Related papers: Solvability in groups with a chain condition on un…

The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…

Let $G$ be a reductive algebraic group over an algebraically closed field and let $V$ be a quasi-projective $G$-variety. We prove that the set of points $v\in V$ such that ${\rm dim}(G_v)$ is minimal and $G_v$ is reductive is open. We also…

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

We study the notion of structured realizability for linear systems defined over graphs. A stabilizable and detectable realization is structured if the state-space matrices inherit the sparsity pattern of the adjacency matrix of the…

The group theoretical treatment of bound and scattering state problems is extended to include band structure. We show that one can realize Hamiltonians with periodic potentials as dynamical symmetries, where representation theory provides…

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…

Let $R=K[G]$ be a group ring of a group $G$ over a field $K$. It is known that if $G$ is amenable then $R$ satisfies the Ore condition: for any $a,b\in R$ there exist $u,v\in R$ such that $au=bv$, where $u\ne0$ or $v\ne0$. It is also true…

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from…

We prove that an algebraic stack with affine stabilizers over an arbitrary base is \'etale-locally a quotient stack around any point with a linearly reductive stabilizer. This generalizes earlier work by the authors of this article (stacks…

In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…

We prove that an element $g$ of prime order $>3$ belongs to the solvable radical $R(G)$ of a finite (or, more generally, a linear) group if and only if for every $x\in G$ the subgroup generated by $g, xgx^{-1}$ is solvable. This theorem…

We consider the Euler alignment system with mildly singular interaction kernels. When the local repulsion term is of the fractional type, global in time existence of smooth solutions was proved…

We study special subgroups of infinite groups that generalize double centralizers. We analyze sufficient conditions for descending chains of such subgroups to stop after finitely many steps. We discuss whether this phenomenon can happen in…

We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…

In this paper, we present a general framework for constructively proving the existence and of stationary localized solutions, spatially periodic solutions, and branches of spatially periodic solutions in the 1D Thomas model. Specifically,…

We present a computational tool that can be used to obtain the "spatial" homology groups of a causal set. Localisation in the causal set is seeded by an inextendible antichain, which is the analog of a spacelike hypersurface, and a one…

In this paper we work in an arbitrary o-minimal structure with definable Skolem functions and we prove that definably connected, locally definable manifolds are uniformly definably path connected, have an admissible cover by definably…