Related papers: Groups and Combinatorial Number Theory
We study the combinatorics of the contributions to the form factor of the group U(N) in the large $N$ limit. This relates to questions about semiclassical contributions to the form factor of quantum systems described by the unitary…
We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.
The survey contains a brief description of the ideas, constructions, results, and prospects of the theory of hypergroups and generalized translation operators. Representations of hypergroups are considered, being treated as continuous…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.
We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive…
Covering theory is an important tool in representation theory of algebras, however, the results and the proofs are scattered in the literature. We give an introduction to covering theory at a level as elementary as possible.
The paper gives a short account of the contents of "Regular Algebraic K-Theory For Groups" by the author and its connections with other homology and K-theories.
This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
We give an overview of the basic definitions of condensed categories, as well as the internal Hom of condensed abelian groups. We give a construction for the internal Hom of condensed sets and apply it to obtain a new proof of a theorem of…
Given a group G and a normal subgroup H we study the problem of choosing coset representatives with few carries.
It is described the group of arrowy permutations (that is extension of symmetric group) and the consequent process of generation of GL(n) and some its subgroups by this combinatoric group and its subgroups.
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all whose subgroups are normal are presented.
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
This survey is about combinatorial objects related to reflection groups and their applications in representation theory and arithmetic geometry. Coxeter groups and folded galleries in Coxeter complexes are introduced in detail and…