Related papers: Lehmer's Problem, McKay's Correspondence, and $2,3…
Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…
A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…
Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…
A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…
We investigate Lie bialgebra structures on simple Lie algebras of non-split type $A$. It turns out that there are several classes of such Lie bialgebra structures, and it is possible to classify some of them. The classification is obtained…
We study the Hecke algebra $\H(\bq)$ over an arbitrary field $\FF$ of a Coxeter system $(W,S)$ with independent parameters $\bq=(q_s\in\FF:s\in S)$ for all generators. This algebra is always linearly spanned by elements indexed by the…
We give a simple proof of the fact that - in all dimensions - there are no homogeneous solutions to the thin obstacle problem with frequency $\lambda$ belonging to intervals of the form $(2k,2k+1)$, $k \in \mathbb{N}$. In particular, there…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…
Algebraic statistics is concerned with the study of probabilistic models and techniques for statistical inference using methods from algebra and geometry. This article presents a list of open mathematical problems in this emerging field,…
In this article, we introduce a notion of size for sets called thickness that can be used to guarantee that two Cantor sets intersect (the Gap Lemma), and show a connection among Thickness, Schmidt Games and Patterns. We work mostly in the…
The generalized Busemann-Petty problem asks whether centrally-symmetric convex bodies having larger volume of all m-dimensional sections necessarily have larger volume. When m>3 this is known to be false, but the cases m=2,3 are still open.…
In this paper, we show some results about the gap between a prime number and its consecutive prime number for large enough prime numbers. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…
A graph is called Rank-Ramsey if (i) Its clique number is small, and (ii) The adjacency matrix of its complement has small rank. We initiate a systematic study of such graphs. Our main motivation is that their constructions, as well as…
The $\lambda$-quiddities of size $n$ are $n$-tuples of elements of a fixed set, solutions of a matrix equation appearing in the study of Coxeter's friezes. Their number and their properties are closely linked to the structure and the…
In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…
It was proved by J. Schatz that the covering radius of the second order Reed--Muller code $RM(2, 6)$ is 18 (IEEE Trans Inf Theory 27: 529--530, 1985). However, the covering radius of $RM(2,7)$ has been an open problem for many years. In…
Let $m,n,s,k$ be four integers such that $3\leq s \leq n$, $3\leq k\leq m$ and $ms=nk$. Set $d=\gcd(s,k)$. In this paper we show how one can construct a Heffter array $H(m,n;s,k)$ starting from a square Heffter array $H(nk/d;d)$ whose…
Let $v=2ms+t$ be a positive integer, where $t$ divides $2ms$, and let $J$ be the subgroup of order $t$ of the cyclic group $\mathbb{Z}_v$. An integer Heffter array $H_t(m,n;s,k)$ over $\mathbb{Z}_v$ relative to $J$ is an $m\times n$…
Sperner theory is one of the most important branches in extremal set theory. It has many applications in the field of operation research, computer science, hypergraph theory and so on. The LYM property has become an important tool for…