Related papers: A Combinatorial Problem from Group Theory
In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
Hat problems have recently become a popular topic in combinatorics and discrete mathematics. These have been shown to be strongly related to coding theory, network coding, and auctions. We consider the following version of the hat game,…
In the classical probability model, let $f(n)$ be the maximum number of pairwise independent events for the sample space with $n$ sample points. The determination of $f(n)$ is equivalent to the problem of determining the maximum cardinality…
We introduce the notion of $GL(n)$-dependence of matrices, which is a generalization of linear dependence taking into account the matrix structure. Then we prove a theorem, which generalizes, on the one hand, the fact that $n+1$ vectors in…
We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
In this paper we prove Conjecture \ref{conj1} for a set of representations of the group $GL_n({\bf A})$. This Conjecture is stated in complete generality as Conjecture 1 in \cite{G2}, and here we prove it for various cases. See Conjecture…
J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such problem is maximum clique which -- under standard assumptions in complexity theory -- cannot be solved in…
Le but cette note est de tenter d'expliquer les liens \'etroits qui unissent la th\'eorie des empilements de cercles et des modules combinatoires, et de comparer les approches \`a la conjecture de J.W. Cannon qui en d\'ecoulent. ???? The…
Kingman's Theorem on skeleton limits---passing from limits as $n\to \infty $ along $nh$ ($n\in \mathbb{N}$) for enough $h>0$ to limits as $t\to \infty $ for $t\in \mathbb{R}$---is generalized to a Baire/measurable setting via a topological…
K\"ulshammer, Olsson, and Robinson developed an l-analogue of modular representation theory of symmetric groups where l is not necessarily a prime. They gave a conjectural combinatorial description for invariant factors of the Cartan matrix…
We provide a brief overview of tensor models and group field theories, focusing on their main common features. Both frameworks arose in the context of quantum gravity research, and can be understood as higher-dimensional generalizations of…
A conjecture by Higman asserts that the number of conjugacy classes in the unipotent group of upper triangular matrices over a finite field depends polynomially on the number of elements of the field. We will study several alternative…
An interaction system has a finite set of agents that interact pairwise, depending on the current state of the system. Symmetric decomposition of the matrix of interaction coefficients yields the representation of states by self-adjoint…
We establish two consequences of the Kawamata--Morrison--Totaro cone conjecture, and prove them unconditionally in all dimensions. First, for a K-trivial variety, the natural action of its automorphism group on the set of ample divisor…