Related papers: The Isomorphism Relation Between Tree-Automatic St…
In this paper we study the algebraic structure of $\omega$-stable bilinear maps, arbitrary rings and nilpotent groups. We will also provide rather complete structure theorems for the above structures in the finite Morley rank case.
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
We work with a finite relational vocabulary with at least one relation symbol with arity at least 2. Fix any integer $m > 1$. For almost all finite structures (labelled or unlabelled) such that at least $m$ elements are moved by some…
The decision tree recursively partitions the input space into regions and derives axis-aligned decision boundaries from data. Despite its simplicity and interpretability, decision trees lack parameterized representation, which makes it…
We consider the relationship between the Stanley-Reisner ring (a.k.a. face ring) of a simplicial or boolean complex $\Delta$ and that of its barycentric subdivision. These rings share a distinguished parameter subring. S. Murai asked if…
We prove that the Farrell-Jones isomorphism conjecture for non-connective algebraic K-theory for a discrete group G and a coefficient ring R holds true if G belongs to the class of groups acting on trees, under certain conditions on G (see…
Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism group of Y has an infinite orbit. We prove that there is no automorphism-invariant measure on the set of spanning trees in the direct…
Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…
We consider homogeneous varieties of linear algebras over an associative-commutative ring K with 1, i.e., the varieties in which free algebras are graded. Let F be a free algebra of some variety A of linear algebras over K freely generated…
Generalized Baumslag-Solitar groups (GBS groups) are groups that act on trees with infinite cyclic edge and vertex stabilizers. Such an action is described by a labeled graph (essentially, the quotient graph of groups). This paper addresses…
We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
Let $\mathcal{M}_{n,d}$ be the moduli space of semi-stable rank $n$, trace-free Higgs bundles with fixed determinant of degree $d$ on a Riemann surface of genus at least $3$. We determine the following automorphism groups of…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
The structure of the automorphism group of a simple TAI algebra is studied. In particular, we show that $\frac{\bar{\mrm{Inn}} (A)}{\bar{\mrm{Inn}}_{0} (A)}$ is isomorphic (as a topological group) to an inverse limit of discrete abelian…
We study left-invariant locally conformally K\"ahler structures on Lie groups, or equivalently, on Lie algebras. We give some properties of these structures in general, and then we consider the special cases when its complex structure is…
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…
We show that any order isomorphism between ordered structures of associative unital JB-subalgebras of JBW algebras is implemented naturally by a Jordan isomorphism. Consequently, JBW algebras are determined by the structure of their…