Feb 24, 2020 · There was a time in the early 2010s when Vertex Aquaristik had an outsize influence on the reef aquarium hobby – their skimmers, reactors and a growing catalog of other reef aquarium …
Deploy your app to Render (⭐ 0)
Oct 7, 2012 · My vertex omega 150 pump impeller has some ceramic that chipped off. I was interested in a replacing the whole pump if possible. Quick search got me the tunze 9420 but I didn't know if …
A coloring of the vertex set of a graph using the colors red and blue is a closed neighborhood balanced coloring if for each vertex there are an equal number of red and blue vertices in its closed neighborhood. A graph with such a coloring is called...
Following Baxter's method of producing Q_{72}-operator, we construct the Q-operator of the root-of-unity eight-vertex model for the crossing parameter $η= \frac{2m K}{N}$ with odd $N$ where Q_{72} does not exist. We use this new Q-operator to stud...
We examine the Onsager algebra symmetry of $τ^{(j)}$-matrices in the superintegrable chiral Potts model. The comparison of Onsager algebra symmetry of the chiral Potts model with the $sl_2$-loop algebra symmetry of six-vertex model at roots of uni...
For a graph $G = (V,E),$ a subset $S$ of $V$ is a perfect dominating set of $G$ if every vertex not in $S$ is adjacent to exactly one vertex in $S.$ The perfect domination number, $γ_p(G),$ is the minimum cardinality of a perfect dominating set of $...
We provide a simple construction of a Gerstenhaber-infinity algebra structure on a class of vertex algebras V, which lifts the strict Gerstenhaber algebra structure on BRST cohomology of V introduced by Lian and Zuckerman. We outline two applicat...
To fully exploit the HERA-II upgrade,the ZEUS experiment has installed a Micro Vertex Detector (MVD) using n-type, single-sided, silicon micro-strip sensors with capacitive charge division. The sensors have a readout pitch of 120 micrometers, with...
In 1979 Babai found a clever argument to prove that every connected vertex transitive graph on $n \ge 3$ vertices contains a cycle of length at least $\sqrt{3n}$. Here we modify his approach to show that such graphs must contain a cycle of length at...
The Four Vertex Theorem, one of the earliest results in global differential geometry, says that a simple closed curve in the plane, other than a circle, must have at least four "vertices", that is, at least four points where the curvature has a loc...
We show the following for every sufficiently connected graph $G$, any vertex subset $S$ of $G$, and given integer $k$: there are $k$ disjoint odd cycles in $G$ each containing a vertex of $S$ or there is set $X$ of at most $2k-2$ vertices such that $...
In this paper we prove that certain matrix elements of vertex operators of deformed W-algebra satisfy Macdonald difference equations and form n! -dimensional space of solutions. These solutions are the analogues of Harish Chandra solutions with pre...
For a hypergraph $\mathcal H$, we consider the edge-induced and vertex-induced subhypergraph polynomials and study their relation. We use this relation to prove that both polynomials are reconstructible, and to prove a theorem relating the Hilbert se...
In this note, we prove several Turán-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every $n$-vertex geometr...
Given a graph G and a configuration C of pebbles on the vertices of G, a pebbling step removes two pebbles from one vertex and places one pebble on an adjacent vertex. The cover pebbling number g=g(G) is the minimum number so that every configurati...
A sequence $(v_1,\ldots ,v_k)$ of vertices in a graph $G$ without isolated vertices is called a total dominating sequence if every vertex $v_i$ in the sequence totally dominates at least one vertex that was not totally dominated by $\{v_1,\ldots , v_...
In a graph $G$, a vertex dominates itself and its neighbours. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The minimum cardinality among all double dominating sets of $G$...
We introduce the Maker-Breaker domination game, a two player game on a graph. At his turn, the first player, Dominator, select a vertex in order to dominate the graph while the other player, Staller, forbids a vertex to Dominator in order to prevent...
A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $γ(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a set $S$ is a...