Related papers: On minimal bases in homotopical combinatorics

We settle some open problems in the special case of groups in o-minimal structures, such as the equality of G^00 and G^000 and the equivalence of definable amenability and existence of a type with bounded orbit. We prove almost exactness of…

The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

We introduce the classical theory of the interplay between group theory and topology into the context of operads and explore some applications to homotopy theory. We first propose a notion of a group operad and then develop a theory of…

In this paper, we develop a new concept of Global Curvature Bound for an arbitrary nonlinear operator between abstract metric spaces. We use this notion to characterize the global complexity of high-order algorithms solving composite…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

We prove that the homotopy theory of $N_\infty$ operads is equivalent to a homotopy theory of discrete operads, and we construct free and associative operadic realizations of every indexing system. This resolves a conjecture of Blumberg and…

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…

In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them…

In this paper, we set up a rational homotopy theory for operads in simplicial sets whose term of arity one is not necessarily reduced to an operadic unit, extending results obtained by the author in the book "Homotopy of operads and…

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

Given a definably compact group G in a saturated o-minimal structure, there is a canonical homomorphism from G to a compact real Lie group F(G). We establish a similar result for the (o-mininimal) universal cover of a definably compact…

We study some properties of the dynamical realization of isolated left orders of a countable group G. We show that the dynamical realization admits a unique minimal set provided G is not infinite cyclic. We show that convex subgroup of an…

It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

We present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…

In this note, we describe first the structure of minimal non-Iwasawa finite groups. Then we determine the minimal non-Iwasawa finite groups which are modular. Also, we find connections between minimal non-Iwasawa finite groups and the…

In this paper we describe an inductive machinery to investigate asymptotic behaviors of homology groups and related invariants of representations of certain graded combinatorial categories over a commutative Noetherian ring $k$, via…

We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…