Related papers: Study of an identity
Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed,…
We study dynamical systems arising from word maps on simple groups. We develop a geometric method based on the classical trace map for investigating periodic points of such systems. These results lead to a new approach to the search of…
We present a broader framework for the Cauchy identity derived from the determinant expansion of collocation matrices. This approach yields an infinite family of identities, where the original Cauchy identity stands as a particular case. To…
We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We discuss the key ideas that have gone into the results of the last few years.
For convex domains with $C^{1,\epsilon}$ boundary we give a precise description of the automorphism group: if an orbit of the automorphism group accumulates on at least two different closed complex faces of the boundary, then the…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
Syntax connects words to each other in very specific ways. Two words are syntactically connected if they depend directly on each other. Syntactic connections usually happen within a sentence. Gathering all those connection across several…
We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…
In this note, we provide a conceptual explanation of a well-known polynomial identity used in algebraic number theory.
We describe in the space of binary forms of degree d the strata of forms having constant rank. We also give a simple algorithm to determine the rank of a given form.
We study sets of solutions to equations over a free group, projections of such sets, and the structure of elementary sets defined over a free group. The structre theory we obtain enable us to answer some questions of A. Tarski's, and…
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
We give a topological interpretation of the free metabelian group, following the plan described in [Ver1,Ver2]. This interpretation is based on considering the Caley graph of a finitely generated group G as one-dimensional complex; its…
We classify isomorphic classes of the homomorphisms of a root system $\Xi$ to a root system $\Sigma$ which do not change Cartan integers. We examine several types of isomorphic classes defined by the Weyl group of $\Sigma$, that of $\Xi$…
In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.
We use the theory of persistent homology to analyze a data set arising from the study of various aspects of democracy. Our results show that most "mature" democracies look more or less the same, in the sense that they form a single…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…