Related papers: Relative Heffter arrays and biembeddings
Let $t(H;G)$ be the homomorphism density of a graph $H$ into a graph $G$. Sidorenko's conjecture states that for any bipartite graph $H$, $t(H;G)\geq t(K_2;G)^{|E(H)|}$ for all graphs $G$. It is already known that such inequalities cannot…
The mixed braid groups $B_{2,n}, \ n \in \mathbb{N}$, with two fixed strands and $n$ moving ones, are known to be related to the knot theory of certain families of $3$-manifolds. In this paper we define the mixed Hecke algebra…
The classical Heawood inequality states that if the complete graph $K_n$ on $n$ vertices is embeddable in the sphere with $g$ handles, then $g \ge\dfrac{(n-3)(n-4)}{12}$. A higher-dimensional analogue of the Heawood inequality is the…
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…
The strongly interacting 4d N=2 SCFT's of type $(A_n,A_m)$ are the simplest examples of models in the $(G,G^\prime)$ class introduced by Cecotti, Neitzke, and Vafa in arXiv:1006.3435. These systems have a known 3d N=4 mirror only if…
Considering uniform hypergraphs, we prove that for every non-negative integer $h$ there exist two non-negative integers $k$ and $t$ with $k\leq t$ such that two $h$-uniform hypergraphs ${\mathcal H}$ and ${\mathcal H}'$ on the same set $V$…
To do homological algebra with unbounded chain complexes one needs to first find a way of constructing resolutions. Spaltenstein solved this problem for chain complexes of R-modules by truncating further and further to the left, resolving…
The paper deals with partitions of hypergraphs into induced subhypergraphs satisfying constraints on their degeneracy. Our hypergraphs may have multiple edges, but no loops. Given a hypergraph $H$ and a sequence $f=(f_1,f_2, \ldots, f_p)$…
We find all irreducible hypergeometric sheaves whose geometric monodromy group is finite, almost quasisimple and has the projective special linear group $PSL_n(q)$ with $n\geq 3$ as a composition factor. We use the classification of…
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…
Given a set $S$ of $v \ge 2$ symbols, and integers $k \ge t \ge 2$ and $N \ge 1$, an $N \times k$ array $A \in S^{N \times k}$ is an $(N; t, k, v)$-covering array if all sequences in $S^t$ appear as rows in every $N \times t$ subarray of…
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…
This note extends some results of a previous paper (math.RT/0403250) about finite dimensional representations of the wreath product symplectic reflection algebra H(k,c,N,G) of rank N attached to a finite subgroup G of SL(2,C) (here k is a…
We introduce extensions of the multidimensional Heisenberg group $\mathbb{H}^n$ by two-parameter groups of dilations, and then classify the extended groups up to isomorphism, by employing Lie algebra techniques. We show that the groups are…
For any nonempty, compact and fiberwise convex set $K$ in $T^*\mathbb{R}^n$, we prove an isomorphism between symplectic homology of $K$ and a certain relative homology of loop spaces of $\mathbb{R}^n$. We also prove a formula which computes…
We prove a relative version of the Picard-Lefschetz theorem, describing the variation of relative homology groups $H_d(Y_t \setminus A_t,B_t\setminus A_t)$ in the fibers of a smooth fiber bundle $Y \to T$ of complex manifolds with $A\cup B…
A bicirculant is a regular graph that admits a semi-regular automorphism with two vertex-orbits of the same size. By $m$ we denote the size of vertex-orbits and by $d$ the valence of a bicirculant. Furthermore, we denote by $s$ the valence…
In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…
New classes of Lie-Hamilton systems are obtained from the six-dimensional fundamental representation of the symplectic Lie algebra $\mathfrak{sp}(6,\mathbb{R})$. The ansatz is based on a recently proposed procedure for constructing…
A relative t-design in the binary Hamming association schemes H(n,2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allow different sizes of blocks and a weight function on blocks. In…