Related papers: A combinatorial problem arising in group theory

Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…

The trigonometric moment problem arises from the study of one-parameter families of centers in polynomial vector fields. It asks for the classification of the trigonometric polynomials $Q$ which are orthogonal to all powers of a…

In his earlier work, the author introduced a group theory question that arises in the study of iterated Galois groups of post-critically finite quadratic polynomials. In this paper, we prove the first non-trivial results on this question.

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

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…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

The exterior degree of a finite group has been introduced in [P. Niroomand and R. Rezaei, On the exterior degree of finite groups, Comm. Algebra 39 (2011), 335--343] and the present paper is devoted to study the exterior degree of infinite…

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

The goal of this survey is to present combinatorial modulus that have been recently used to study quasi-conformal properties of boundaries of hyperbolic groups. First, we will recall well known rigidity results and questions that motivated…

We present a survey of results related to the Milnor's problem on group growth. We discuss the cases of polynomial growth, exponential but not uniformly exponential growth, but the main part of the article is devoted to the intermediate…

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization…

Group testing is a long studied problem in combinatorics: A small set of $r$ ill people should be identified out of the whole ($n$ people) by using only queries (tests) of the form "Does set X contain an ill human?". In this paper we…

The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…

In this article we calculate two aspects of the representation theory of a Brauer configuration algebra: its Cartan matrix, and the module length of its associated indecomposable projective modules. Then we introduce the concept of…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…