相关论文: Enumerating limit groups
In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…
We consider a recursive algorithm to construct an aggregated estimator from a finite number of base decision rules in the classification problem. The estimator approximately minimizes a convex risk functional under the l1-constraint. It is…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
For certain theories of existentially closed topological differential fields, we show that there is a strong relationship between $\mathcal L\cup\{D\}$-definable sets and their $\mathcal L$-reducts, where $\mathcal L$ is a relational…
Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…
We study the problem of group linkage: linking records that refer to entities in the same group. Applications for group linkage include finding businesses in the same chain, finding conference attendees from the same affiliation, finding…
The renormalization group has proven to be a very powerful tool in physics for treating systems with many length scales. Here we show how it can be adapted to provide a new class of algorithms for discrete optimization. The heart of our…
The additivity with respect to exact sequences is notoriously a fundamental property of the algebraic entropy of group endomorphisms. It was proved for abelian groups by deeply exploiting their structure. On the other hand, a solvable…
We state and prove a combination theorem for relatively hyperbolic groups seen as geometrically finite convergence groups. For that, we explain how to contruct a boundary for a group that is an acylindrical amalgamation of relatively…
We present algorithms for efficiently learning regularizers that improve generalization. Our approach is based on the insight that regularizers can be viewed as upper bounds on the generalization gap, and that reducing the slack in the…
We prove that cyclic subgroup separability is preserved under exponential completion for groups that belong to a class that includes all coherent RAAGs and toral relatively hyperbolic groups; we do so by exploiting the structure of these…
We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
For a sequence $\gamma=(\gamma_n)_{n\ge 1}$, define \[ L_\gamma(z):=\sum_{n\ge 1}\gamma_n\frac{z^n}{1-z^n} =\sum_{n\ge 1}\Bigl(\sum_{d\mid n}\gamma_d\Bigr)z^n. \] We prove a short rigidity theorem: if $\gamma$ is eventually linearly…
We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…
We present a systematic study for the limit closure $(\underline{x})^{\lim}$ of a sequence of elements $\underline{x}$ (eg. a system of of parameters) in a local ring. Firstly, we answer the question which elements are always contained in…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…