English
Related papers

Related papers: The Isomorphism Relation Between Tree-Automatic St…

200 papers

Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…

Rings and Algebras · Mathematics 2026-02-26 Chandrasekhar Gokavarapu , D. Madhusudhana Rao

We present groupoid morphisms as an algebraic structure for nonautonomous dynamics, as well as a generalization of group morphisms, which describe classic dynamical systems. We introduce the structure of cotranslations, as a specific kind…

Dynamical Systems · Mathematics 2023-11-14 Néstor Jara

The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…

Combinatorics · Mathematics 2007-05-23 Zoran Sunic

Counterexamples to the Modular Isomorphism Problem were discovered recently. These are non-isomorphic finite $2$-groups $G$ and $H$ that have isomorphic group algebras over the field $\mathbb{Z}/2\mathbb{Z}$ and non-isomorphic group…

Group Theory · Mathematics 2025-08-21 Leo Margolis , Taro Sakurai

One of the features inherent in nested Archimedean copulas, also called hierarchical Archimedean copulas, is their rooted tree structure. A nonparametric, rank-based method to estimate this structure is presented. The idea is to represent…

Methodology · Statistics 2013-12-18 Johan Segers , Nathan Uyttendaele

An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…

Formal Languages and Automata Theory · Computer Science 2025-10-13 Marius Bozga , Radu Iosif , Florian Zuleger

We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular…

Dynamical Systems · Mathematics 2018-05-24 Robert Fokkink , Reem Yassawi

We show that the problem of classifying, up to isomorphism, the collection of zero-entropy mixing automorphisms of a standard non-atomic probability space, is intractible. More precisely, the collection of isomorphic pairs of automorphisms…

Dynamical Systems · Mathematics 2025-09-12 Marlies Gerber , Philipp Kunde

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

Geometric Topology · Mathematics 2015-05-27 Martin R. Bridson , Lawrence Reeves

This paper establishes an explicit obstruction to constructing algebraic cycles from automorphic cohomology classes on Shimura varieties. We produce a rational Hodge class $\Omega_E$ in the intersection cohomology of the Baily-Borel…

Number Theory · Mathematics 2026-02-09 Amir Mostaed

We study the Fibered Isomorphism conjecture of Farrell and Jones for groups acting on trees. We show that under certain conditions the conjecture is true for groups acting on trees when the stabilizers satisfy the conjecture. These…

K-Theory and Homology · Mathematics 2013-08-16 S. K. Roushon

It is proved that the family of tree languages recognized by nondeterministic tree-walking automata is not closed under complementation, solving a problem raised by Boja\'nczyk and Colcombet ("Tree-walking automata do not recognize all…

Formal Languages and Automata Theory · Computer Science 2024-12-04 Olga Martynova , Alexander Okhotin

I. M. Chiswell has asked whether every group that admits a free isometric action (without inversions) on a $\Lambda$-tree is orderable. We give an example of a multiple HNN extension $\Gamma$ which acts freely on a $\mathbb{Z}^2$-tree but…

Group Theory · Mathematics 2012-12-10 Shane O. Rourke

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…

Group Theory · Mathematics 2008-02-03 Walter D. Neumann , Michael Shapiro

This paper can be viewed as a continuation of [KS09] that dealt with the automorphism tower problem without Choice. Here we deal with the inequation which connects the automorphism tower and the normalizer tower without Choice and introduce…

Logic · Mathematics 2011-11-18 Itay Kaplan , Saharon Shelah

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…

Machine Learning · Computer Science 2008-07-21 François Denis , Amaury Habrard , Rémi Gilleron , Marc Tommasi , Édouard Gilbert

We define the Polish space $\mathcal{R}$ of non-degenerate rank-1 systems. Each non-degenerate rank-1 system can be viewed as a measure-preserving transformation of an atomless, $\sigma$-finite measure space and as a homeomorphism of a…

Dynamical Systems · Mathematics 2013-03-14 Su Gao , Aaron Hill

$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Mikołaj Bojańczyk , Bartek Klin

Let $\sigma$ be an automorphism of a field $K$ with fixed field $F$. We study the automorphisms of nonassociative unital algebras which are canonical generalizations of the associative quotient algebras $K[t;\sigma]/fK[t;\sigma]$ obtained…

Rings and Algebras · Mathematics 2021-04-13 Christian Brown , Susanne Pumpluen

For suitable groups G we will show that one can add a Boolean algebra B by forcing in such a way that Aut(B) is almost isomorphic to G. In particular, we will give a positive answer to the following question due to J.Roitman: Is…

Logic · Mathematics 2007-05-23 Tapani Hyttinen , Saharon Shelah
‹ Prev 1 4 5 6 7 8 10 Next ›