Related papers: Geodesic rewriting systems and pregroups
We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches consider local search techniques. In this…
Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…
Deciding whether saddle points exist or are approximable for nonconvex-nonconcave problems is usually intractable. This paper takes a step towards understanding a broad class of nonconvex-nonconcave minimax problems that do remain…
Let $G$ be a finitely generated group. We show that for any finite generating set $A$, the language consisting of all geodesics in $Cay(G,A)$ with a contracting property is a regular language. As an application, we show that any finitely…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
A Lie system is a non-autonomous system of first-order ordinary differential equations whose general solution can be written via an autonomous function, a so-called (nonlinear) superposition rule of a finite number of particular solutions…
In this paper we introduce the geodesic conjugacy language and geodesic conjugacy growth series for a finitely generated group. We study the effects of various group constructions on rationality of both the geodesic conjugacy growth series…
We investigate algebraic and compositional properties of abstract multiway rewriting systems, which are archetypical structures underlying the formalism of the Wolfram model. We demonstrate the existence of higher homotopies in this class…
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
The aim of this note is to prove that monoids $\mathrm{Mon}\langle a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…
We explicitly construct new subgroups of the mapping class groups of an uncountable collection of infinite-type surfaces, including, but not limited to, free groups, Baumslag-Solitar groups, mapping class groups of other surfaces, and a…
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…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
We consider a set of generators for the space of Eisenstein series of even weight $k$ for any congruence group $\Gamma$ and study the set of all of their zeros taken for $\Gamma(1)$-conjugates of $\Gamma$ in the standard fundamental domain…
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…
We relate the topology of the Morse boundary of a group to geometric and algorithmic properties of the group. In particular, we show that a group has $\sigma$-compact Morse boundary if and only if it is Morse local-to-global. We also…
We study the middle convolution of local systems and realize special linear groups as Galois groups over the rationals. In the Appendix to this paper, written jointly with Stefan Reiter, we prove the existence of a new motivic local system…
This paper explicitly constructs the complete set of optimal sub-Riemannian geodesics starting from a point for certain Carnot groups of step two. These are groups of dimension 2n+1 equipped with a left-invariant distribution of dimension…
We prove that Morse local-to-global groups grow exponentially faster than their infinite index stable subgroups. This generalizes a result of Dahmani, Futer, and Wise in the context of quasi-convex subgroups of hyperbolic groups to a broad…