Related papers: Canonicality of Makanin-Razborov Diagrams - Counte…
In this paper, we discuss a group-theoretical generalization of the well-known Gauss formula involving the functionthat counts the number of automorphisms of a finite group. This gives several characterizations of finite cyclic groups.
A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent set.
We provide new examples of the asymptotic counting for the number of subsets on groups of given size which are free of certain configurations. These examples include sets without solutions to equations in non-abelian groups, and linear…
It is known that the existential theory of equations in free groups is decidable. This is a famous result of Makanin. On the other hand it has been shown that the scheme of his algorithm is not primitive recursive. In this paper we present…
Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…
Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…
Free noncommutative fields constitute a natural and interesting example of constrained theories with higher derivatives. The quantization methods involving constraints in the higher derivative formalism can be nicely applied to these…
A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
Let $A$ be a not necessarily commutative monoid with zero such that projective $A$-acts are free. This paper shows that the algebraic K-groups of $A$ can be defined using the +-construction and the Q-construction. It is shown that these two…
For any 1-reduced simplicial set $K$ we define a canonical, coassociative coproduct on $\Om C(K)$, the cobar construction applied to the normalized, integral chains on $K$, such that any canonical quasi-isomorphism of chain algebras from…
By constructing, in the relative case, objects analoguous to Rips and Sela's canonical representatives, we prove that the set of images by morphisms without accidental parabolic, of a finitely presented group in a relatively hyperbolic…
An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…
Let $G_\Gamma$ be a graph product over a finite simplicial graph $\Gamma$, and let $K_\Gamma$ denote the kernel of the canonical homomorphism from $G_\Gamma$ to the direct product of its vertex groups. It is known that, up to isomorphism,…
We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the…
Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…
The groupoid of finite sets has a "canonical" structure of a symmetric 2-rig with the sum and product respectively given by the coproduct and product of sets. This 2-rig $\widehat{\mathbb{F}\mathbb{S} et}$ is just one of the many…
Shumyatsky and the second author proved that if G is a finitely generated residually finite p-group satisfying a law, then, for almost all primes, the fact that a normal and commutator-closed set of generators satisfies a positive law…