Related papers: A combinatorial problem arising in group theory

In this paper the concept of $\mathbb{F}$-functorial of a finite group was introduced. These functorials have many properties of the Fitting subgroup of a soluble group and the generalized Fitting subgroup of a finite group. It was shown…

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

We prove two conjectures of E. Khukhro and P. Shumyatsky concerning the Fitting height and insoluble length of finite groups. As a by-product of our methods, we also prove a generalization of a result of Flavell, which itself generalizes…

A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…

We introduce a new class of combinatorial markets in which agents have covering constraints over resources required and are interested in delay minimization. Our market model is applicable to several settings including scheduling, cloud…

The Lagrange problem is established in the discrete field theory subject to constraints with values in a Lie group. For the admissible sections that satisfy a certain regularity condition, we prove that the critical sections of such…

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1)…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

The inverse problem of Galois Theory was developed in the early 1800 s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over Q (field of…

We investigate the prescribed Ricci curvature problem in the class of left-invariant naturally reductive Riemannian metrics on a non-compact simple Lie group. We obtain a number of conditions for the solvability of the underlying equations…

The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with…

The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

$\lambda$-quiddities of size $n$ are $n$-tuples of elements from a fixed set that are solutions to a matrix equation which is fundamental in the study of the combinatorics of the modular group and Coxeter's friezes. To gain further insight…

We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…