English
Related papers

Related papers: Relative Heffter arrays and biembeddings

200 papers

An embedding construction $G\hookrightarrow H$ for groups $G$ with a length function was introduced by the author earlier. Here we obtain new properties of this embedding, answering some questions raised by M.V. Sapir. In particular, an…

Group Theory · Mathematics 2014-06-17 Alexander Yu. Olshanskii

The nearly complete bipartite graph $G(m,n,k)$ is obtained by removing $k$ independent edges from the complete bipartite graph $K_{m,n}$. In this paper, we prove that for any nearly complete bipartite graph $G(m,n,k)$ with $m, n\geq 3$, and…

Combinatorics · Mathematics 2026-01-13 Shengxiang Lv

Let $H$ be a semisimple Hopf algebra over an algebraically closed field $\mathbbm{k}$ of characteristic $p>\dim_{\mathbbm{k}}(H)^{1/2}$ and $p\nmid 2\dim_{\mathbbm{k}}(H)$. In this paper, we consider the smash product semisimple Hopf…

Representation Theory · Mathematics 2022-02-15 Zhihua Wang , Gongxiang Liu , Libin Li

HyperBagGraphs (hb-graphs as short) extend hypergraphs by allowing the hyperedges to be multisets. Multisets are composed of elements that have a multiplicity. When this multiplicity has positive integer values, it corresponds to non…

Discrete Mathematics · Computer Science 2018-09-19 Xavier Ouvrard , Jean-Marie Le Goff , Stephane Marchand-Maillet

The long root geometry $A_{n,\{1,n\}}(\mathbb{K})$ for the special linear group $\mathrm{SL}(n+1,\mathbb{K})$ admits an embedding in the (projective space of) the vector space of the traceless square matrices of order $n+1$ with entries in…

Representation Theory · Mathematics 2026-04-17 I. Cardinali , L. Giuzzi , A. Pasini

Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…

Combinatorics · Mathematics 2013-12-13 Susana-Clara López , Francesc-Antoni Muntaner-Batle

We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…

Number Theory · Mathematics 2022-02-09 Kwang-Wu Chen

We investigate the relative assembly map from the family of finite subgroups to the family of virtually cyclic subgroups for the algebraic $K$-theory of twisted group rings of a group G with coefficients in a regular ring R or, more…

K-Theory and Homology · Mathematics 2024-08-02 Wolfgang Lueck

For positive integers n and r we define the Haggkvist-Hell graph, H_{n:r}, to be the graph whose vertices are the ordered pairs (h,T) where T is an r-subset of [n], and h is an element of [n] not in T. Vertices (h_x,T_x) and (h_y,T_y) are…

Combinatorics · Mathematics 2013-05-28 David Roberson

We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…

Geometric Topology · Mathematics 2022-04-12 S. Avvakumov , I. Mabillard , A. Skopenkov , U. Wagner

We study relative Cohn path algebras, also known as Leavitt-Cohn path algebras, and we realize them as partial skew group rings (to do this we prove uniqueness theorems for relative Cohn path algebras). Furthermore, given any graph $E$ we…

Rings and Algebras · Mathematics 2019-11-12 Cristóbal Gil Canto , Daniel Gonçalves

Let $S$ be a subset of the cyclic group $\Z_n$. The cyclic Haar graph $H(\Z_n,S)$ is the bipartite graph with color classes $\Z_n^+$ and $\Z_n^-,$ and edges $\{x^+,y^-\},$ where $x,y \in \Z_n$ and $y - x \in S$. In this paper we give…

Combinatorics · Mathematics 2012-12-14 Sergio Hiroki Koike-Quintanar , István Kovács

The quadratic embedding property of graphs consisting of three paths (theta graphs) is fully characterised. For this aim, a theorem by Winkler (1985) is utilized. An alternative proof of that result using the RKHS technique is presented.

Combinatorics · Mathematics 2026-03-26 Marek Skrzypczyk

This paper introduces a novel class of prime-generating quadratic polynomials defined by $f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + \frac{(2Zk - 1)^2 + H}{4}$, where $Zk \in \mathbb{Z}_{\geq 0}$ and $H$ belongs to the set of Heegner numbers. This…

Number Theory · Mathematics 2025-08-06 Sudarshan Kumaresan , Shipra Kumari , Neha Mishra

Two $n$-dimensional vectors $A$ and $B$, $A,B \in \mathbb{R}^n$, are said to be \emph{trivially orthogonal} if in every coordinate $i \in [n]$, at least one of $A(i)$ or $B(i)$ is zero. Given the $n$-dimensional Hamming cube $\{0,1\}^n$, we…

Combinatorics · Mathematics 2017-01-13 Niranjan Balachandran , Rogers Mathew , Tapas Kumar Mishra , Sudebkumar Prasant Pal

This paper considers minimum-dimensional representations of graphs in pseudo-Euclidean spaces, where adjacency and non-adjacency relations are reflected in fixed scalar square values. A representation of a simple graph $(V,E)$ is a mapping…

Combinatorics · Mathematics 2026-03-03 Hiroshi Nozaki , Masashi Shinohara , Sho Suda

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

Combinatorics · Mathematics 2007-05-23 E. Rodney Canfield , Catherine Greenhill , Brendan D. McKay

Sidorenko's conjecture states that for every bipartite graph $H$ on $\{1,\cdots,k\}$, $\int \prod_{(i,j)\in E(H)} h(x_i, y_j) d\mu^{|V(H)|} \ge \left( \int h(x,y) \,d\mu^2 \right)^{|E(H)|}$ holds, where $\mu$ is the Lebesgue measure on…

Combinatorics · Mathematics 2014-06-09 Jeong Han Kim , Choongbum Lee , Joonkyung Lee

We work in the smooth category. Let $N$ be a closed connected orientable 4-manifold with torsion free $H_1$, where $H_q:=H_q(N;Z)$. Our main result is a complete readily calculable classification of embeddings $N\to R^7$, up to the…

Geometric Topology · Mathematics 2022-02-15 D. Crowley , A. Skopenkov

In the binomial random graph $\mathcal{G}(n,p)$, when $p$ changes from $(1-\varepsilon)/n$ (subcritical case) to $1/n$ and then to $(1+\varepsilon)/n$ (supercritical case) for $\varepsilon>0$, with high probability the order of the largest…

Combinatorics · Mathematics 2018-10-19 Oliver Cooley , Wenjie Fang , Nicola Del Giudice , Mihyun Kang