English
Related papers

Related papers: Square Integer Heffter Arrays with Empty Cells

200 papers

A Butson Hadamard matrix $H$ has entries in the kth roots of unity, and satisfies the matrix equation $HH^{\ast} = nI_{n}$. We write $\mathrm{BH}(n, k)$ for the set of such matrices. A complete morphism of Butson matrices is a map…

Combinatorics · Mathematics 2019-01-15 Ronan Egan , Padraig O Cathain , Eric Swartz

Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the Erd\H{o}s--Szekeres theorem is known and empty triangles have been investigated. We introduce a…

Computational Geometry · Computer Science 2026-03-17 Helena Bergold , Joachim Orthaber , Manfred Scheucher , Felix Schröder

A mixed graph is called \emph{second kind hermitian integral}(or \emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of second kind are integers. A mixed graph is called \emph{Eisenstein integral} if the eigenvalues of…

Combinatorics · Mathematics 2022-06-23 Monu Kadyan , Bikash Bhattacharjya

The method of hypergraph containers, introduced recently by Balogh, Morris, and Samotij, and independently by Saxton and Thomason, has proved to be an extremely useful tool in the study of various monotone graph properties. In particular, a…

Combinatorics · Mathematics 2018-06-12 Robert Morris , Wojciech Samotij , David Saxton

We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…

Combinatorics · Mathematics 2022-06-28 Abigail Thompson

A graph $G$ is $H$-induced-saturated if $G$ is $H$-free but deleting any edge or adding any edge creates an induced copy of $H$. There are non-trivial graphs $H$, such as $P_4$, for which no finite $H$-induced-saturated graph $G$ exists. We…

Combinatorics · Mathematics 2025-09-03 Marthe Bonamy , Carla Groenland , Tom Johnston , Natasha Morrison , Alex Scott

A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…

Combinatorics · Mathematics 2018-08-14 Tuan Tran

In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…

Rings and Algebras · Mathematics 2026-03-12 Theophilus Agama , Gael Kibiti

Integrals in Hopf algebras are an essential tool in studying finite dimensional Hopf algebras and their action on algebras. Over fields it has been shown by Sweedler that the existence of integrals in a Hopf algebra is equivalent to the…

Rings and Algebras · Mathematics 2007-05-23 Christian Lomp

It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…

Rings and Algebras · Mathematics 2024-05-29 Vítězslav Kala , Tomáš Kepka , Miroslav Korbelář

Unlike minors, the induced subgraph obstructions to bounded treewidth come in a large variety, including, for every $t\geq 1$, the $t$-basic obstructions: the graphs $K_{t+1}$ and $K_{t,t}$, along with the subdivisions of the $t$-by-$t$…

Combinatorics · Mathematics 2024-12-02 Bogdan Alecu , Maria Chudnovsky , Sepehr Hajebi , Sophie Spirkl

Let $n\geq m$ be two positive integers, $S_{n,m}=K[x_1,\ldots,x_n,y_1,\ldots,y_m]$ and $I_{n,m}=(x_iy_j\;:\;1\leq i\leq n,1\leq j\leq m)\subset S_{n,m}$ the edge ideal of a complete bipartite graph. Denote…

Commutative Algebra · Mathematics 2026-02-11 Andreea I. Bordianu , Mircea Cimpoeas

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…

Number Theory · Mathematics 2024-04-10 Ajai Choudhry , Bibekananda Maji

A {\em theta} is a graph made of three internally vertex-disjoint chordless paths $P_1 = a \dots b$, $P_2 = a \dots b$, $P_3 = a \dots b$ of length at least~2 and such that no edges exist between the paths except the three edges incident to…

Discrete Mathematics · Computer Science 2023-10-23 Marcin Pilipczuk , Ni Luh Dewi Sintiari , Stéphan Thomassé , Nicolas Trotignon

We study the multiplicative Hilbert matrix, i.e. the infinite matrix with entries $(\sqrt{mn}\log(mn))^{-1}$ for $m,n\geq2$. This matrix was recently introduced within the context of the theory of Dirichlet series, and it was shown that the…

Functional Analysis · Mathematics 2017-08-31 Karl-Mikael Perfekt , Alexander Pushnitski

An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…

Discrete Mathematics · Computer Science 2013-09-05 Benjamin Lévêque , David Y. Lin , Frédéric Maffray , Nicolas Trotignon

The Dirichlet--Hardy space $\Ht$ consists of those Dirichlet series $\sum_n a_n n^{-s}$ for which $\sum_n |a_n|^2<\infty$. It is shown that the Blaschke condition in the half-plane $\operatorname{Re} s>1/2$ is a necessary and sufficient…

Complex Variables · Mathematics 2014-12-10 Kristian Seip

A group $H \cong {\mathbb Z}_{k}^{2g}$, where $g,k \geq 2$ are integers, of conformal automorphisms of a closed Riemann surface $S$ is called a $(g,k)$-Fermat group if it acts freely with quotient $S/H$ of genus $g$. We study some…

Complex Variables · Mathematics 2023-08-30 Ruben A. Hidalgo

A spectrahedron is the positivity region of a linear matrix pencil and thus the feasible set of a semidefinite program. We propose and study a hierarchy of sufficient semidefinite conditions to certify the containment of a spectrahedron in…

Optimization and Control · Mathematics 2015-03-23 Kai Kellner , Thorsten Theobald , Christian Trabandt

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…

Combinatorics · Mathematics 2024-03-05 Oswin Aichholzer , Joachim Orthaber , Birgit Vogtenhuber