Related papers: On minimal bases in homotopical combinatorics

Let $G$ be a finite permutation group acting on $\Omega$. A base for $G$ is a subset $B \subseteq \Omega$ such that the pointwise stabilizer $G_{(B)}$ is the identity. The base size of $G$, denoted by $b(G)$, is the cardinality of the…

We study local generalized additive decompositions (GADs) of homogeneous polynomials and their associated point schemes through their local inverse systems. We prove that their construction and algebraic properties are independent of the…

We sharpen the orbit method for finite groups of small nilpotence class by associating representations to functionals on the corresponding Lie rings. This amounts to describing compatible intertwiners between representations parameterized…

In this thesis we study the following property of a finite group G: the minimal number n such that G embeds in Sn. We start with an explicit formula for the number n for abelian groups. Then, we study the behavior of this group property in…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

We prove finite generation of the algebras of invariants for a class of linear actions of suitable non-reductive groups on projective and affine varieties, and give a geometric construction for their GIT quotients.

The algebra of invariants of several 3 x 3 matrices under the action of the orthogonal group by simultaneous conjugation is considered over a field of characteristic different from two. The maximal degree of elements of minimal system of…

When G is a region in the complex plane, compact composition operators on the uniform algebra of bounded analytic functions on G and the spectra of these operators were described by D. Swanton, Compact composition operators on B(D), Proc.…

We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy…

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

For a group $G$ and a finite set $A$, denote by $\text{CA}(G;A)$ the monoid of all cellular automata over $A^G$ and by $\text{ICA}(G;A)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of…

Let $G$ be a connected Lie group and $\text{Sub}_G$ be the space of closed subgroups of $G$ equipped with the Chabauty topology. In this article, we investigate the existence of invariant random subgroups of $G$ supported on various orbits…

Algebraic operads provide a powerful tool to understand the homotopy theory of the types of (co)algebras they encode. So far, the principal results and methods that this theory provides were only available in characteristic zero. The reason…

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…

We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…

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…

We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…