List of AMD graphics processing units - Wikipedia
perform. Measured in operations/s. Vertex operations - The amount of geometry operations that can be processed on the vertex shaders in one second (only applies
Two point functions for the six vertex model with reflecting end
The two point functions, which give the probability that the spins turn down at the boundaries, are studied for the six vertex model on a $2N \times N$ lattice with domain wall boundary condition and left reflecting end. We consider two types of two...
On the correspondence between mirror-twisted sectors for N=2 supersymmetric vertex operato…
Using recent results of the author along with Vander Werf, we present the classification and construction of mirror-twisted modules for N=2 supersymmetric vertex operator superalgebras of the form $V \otimes V$ for the signed transposition mirror map...
On generators and relations for higher level Zhu algebras and applications
We give some general results about the generators and relations for the higher level Zhu algebras for a vertex operator algebra. In particular, for any element $u$ in a vertex operator algebra $V$, such that $u$ has weight greater than or equal to $-...
The level two Zhu algebra for the Heisenberg vertex operator algebra
We determine the level two Zhu algebra for the Heisenberg vertex operator algebra $V$ for any choice of conformal element. We do this using only the following information for $V$: the internal structure of $V$; the level one Zhu algebra of $V$ alread...
Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
The classic theorem of Gallai and Milgram (1960) asserts that for every graph G, the vertex set of G can be partitioned into at most α(G) vertex-disjoint paths, where α(G) is the maximum size of an independent set in G. The proof of Gallai--Milgram...
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex II: A Tight Result
We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for large $m$,...
Spanning Trees in Graphs of High Minimum Degree with a Universal Vertex I: An Asymptotic R…
In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph...
OPE-Algebras and their Modules
Vertex algebras formalize the subalgebra of holomorphic fields of a conformal field theory. OPE-algebras were proposed as a generalization of vertex algebras that formalizes the algebra of all fields of a conformal field theory. We prove some basic...
Some results on concatenating bipartite graphs
We consider two functions $φ$ and $ψ$, defined as follows. Let $x,y \in (0,1]$ and let $A,B,C$ be disjoint nonempty subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbors in $B$, and every vertex in $B$ has at least $y|C|$...
Vertex Operators and Modular Forms
The leitmotif of these Notes is the idea of a vertex operator algebra (VOA) and the relationship between VOAs and elliptic functions and modular forms. This is to some extent analogous to the relationship between a finite group and its irreducible...
Most Clicks Problem in Lights Out
Consider a game played on a simple graph $G = (V, E)$ where each vertex consists of a clickable light. Clicking any vertex $v$ toggles the on/off state of $v$ and its neighbors. Starting from an initial configuration of lights, one wins the game by f...
Vertex-transitive Neumaier graphs
A graph $Γ$ is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique $C$ in $Γ$ is called regular whenever for any vertex out of $C$, th...
Neighbour transitivity on codes in Hamming graphs
We consider a \emph{code} to be a subset of the vertex set of a \emph{Hamming graph}. In this setting a \emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that s...
Bethe Ansatz solution for quantum spin-1 chains with boundary terms
The procedure for obtaining integrable open spin chain Hamiltonians via reflection matrices is explicitly carried out for some three-state vertex models. We have considered the 19-vertex models of Zamolodchikov-Fateev and Izergin-Korepin, and the $...
The $k$-Total Bondage Number of a Graph
Let $G=(V,E)$ be a connected, finite undirected graph. A set $S \subseteq V$ is said to be a total dominating set of $G$ if every vertex in $V$ is adjacent to some vertex in $S$. The total domination number, $γ_{t}(G)$, is the minimum cardinality of...
Vertex-transitive graphs that have no Hamilton decomposition
It is shown that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition, including infinitely many Cayley graphs of valency 6, and including Cayley graphs of arbitrarily large valency....
Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't
We consider a variation of the problem of corruption detection on networks posed by Alon, Mossel, and Pemantle '15. In this model, each vertex of a graph can be either truthful or corrupt. Each vertex reports about the types (truthful or corrupt) of...
Dynamical Vertex Approximation
Dynamical vertex approximation is a Feynman diagrammatic extension of dynamical mean field theory, including non-local correlations on all time and length scales. Starting with the Dyson and the parquet equations, the lecture notes give an elementary...
A Game of Pawns
We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its next locati...