Related papers: Study of an identity
Geometry is essentially a global language, which is fully understood in different times, countries and cultures. The proof of a geometric theorem (e.g. the Pythagorean Theorem) or a geometric construction (e.g. the construction of an…
A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…
We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…
In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of…
For the first time we represent every finite group in the form of a graph in this book. The authors choose to call these graphs as identity graph, since the main role in obtaining the graph is played by the identity element of the group.…
We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…
We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant…
We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…
The proof identity problem asks: When are two proofs the same? The question naturally occurs when one reflects on mathematical practice. The problem understandably can be seen as a challenge for mathematical logic, and indeed various…
We study possibilities for semantic and syntactic rigidity, i.e., the rigidity with respect to automorphism group and with respect to definable closure. Variations of rigidity and their degrees are studied in general case, for special…
A groupoid identity is said to be linear of length $2k$ if the same $k$ variables appear on both sides of the identity exactly once. We classify and count all varieties of groupoids defined by a single linear identity. For $k=3$, there are…
Real-life tools for decision-making in many critical domains are based on ranking results. With the increasing awareness of algorithmic fairness, recent works have presented measures for fairness in ranking. Many of those definitions…
Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.
We prove the Identity Theorem for pro-$p$-groups with a single defining relation giving a positive feedback to a question of Serre on the structure of relation modules. A construction of "conjurings" indicates finality of our result in a…
We consider the problem of testing whether a correlation matrix of a multivariate normal population is the identity matrix. We focus on sparse classes of alternatives where only a few entries are nonzero and, in fact, positive. We derive a…
We study automorphisms of the free associative algebra K<x,y,z> over a field K which fix the variable z. We describe the structure of the group of z-tame automorphisms and derive algorithms which recognize z-tame automorphisms and z-tame…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
We describe, up to degree equal to the rank, the Lie algebra associated with the automorphism group of a free group. We compute in particular the ranks of its homogeneous components, and their structure as modules over the linear group.…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…