Related papers: Finiteness results for Abelian tree models

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

We define a class of pre-ordered abelian groups that we call finite-by-Presburger groups, and prove that their theory is model-complete. We show that certain quotients of the multiplicative group of a local field of characteristic zero are…

Faltings proved that there are finitely many abelian varieties of genus $g$ over a number field $K$, with good reduction outside a finite set of primes $S$. Fixing one of these abelian varieties $A$, we prove that there are finitely many…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Equivariant networks capture the inductive bias about the symmetry of the learning task by building those symmetries into the model. In this paper, we study how equivariance relates to generalization error utilizing PAC Bayesian analysis…

The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…

We investigate the Constraint Satisfaction Problem (CSP) over templates with a group structure, and algorithms solving CSP that are equivariant, i.e. invariant under a natural group action induced by a template. Our main result is a method…

Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…

We provide a complete description of possible covariance matrices consistent with a Gaussian latent tree model for any tree. We then present techniques for utilising these constraints to assess whether observed data is compatible with that…

We establish a link between abelian regular subgroup of the affine group, and commutative, associative algebra structures on the underlying vector space that are (Jacobson) radical rings. As an application, we show that if the underlying…

We give an explicit description of the category of central extensions of a group scheme by a sheaf of Abelian groups. Based on this, we describe a framework for computing with central extensions of finite commutative group schemes, torsors…

We show a case of Zilber's Exponential-Algebraic Closedness Conjecture, establishing that the conjecture holds for varieties which split as the product of a linear subspace of the additive group $\mathbb{C}^n$ and an algebraic subvariety of…

In this paper we complete the results of Sullivant and Sturmfels proving that many of the algebraic group-based models for Markov processes on trees are pseudo-toric. We also show in which cases these varieties are normal. This is done by…

The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…

A version of the Riesz-Sobolev convolution inequality is formulated and proved for arbitrary compact connected Abelian groups. Maximizers are characterized and a quantitative stability theorem is proved, under natural hypotheses. A…

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…