English
Related papers

Related papers: The initial meadows

200 papers

Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…

Dynamical Systems · Mathematics 2014-03-07 Gregory R. Conner , Wolfram Hojka

We construct, for each irrational number $\alpha$, a minimal $C^1$-diffeomorphism of the circle with rotation number $\alpha$ which admits a measur

Dynamical Systems · Mathematics 2013-06-06 Hiroki Kodama , Shigenori Matsumoto

Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…

Number Theory · Mathematics 2020-09-28 Hideki Murahara , Tatsushi Tanaka

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

Formal Languages and Automata Theory · Computer Science 2026-05-12 Shaull Almagor , Michaël Cadilhac , Asaf Shoham

We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…

Rings and Algebras · Mathematics 2024-05-21 Vítězslav Kala , Lucien Šíma

We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or…

Logic in Computer Science · Computer Science 2018-09-11 Marcin Przybyłko

A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific…

Logic in Computer Science · Computer Science 2012-01-25 Martin Huschenbett

In this paper, we first present a classification theorem of infinite-dimensional simple Novikov algebras over an algebraically closed field with characteristic 0. Then we classify all the irreducible modules of a certain…

Quantum Algebra · Mathematics 2007-05-23 Xiaoping Xu

We introduce the notion of the \emph{first-order part} of a problem in the Weihrauch degrees. Informally, the first-order part of a problem $\mathsf{P}$ is the strongest problem with codomaixn $\omega$ that is Weihrauch reducible to…

Logic · Mathematics 2023-01-31 Damir D. Dzhafarov , Reed Solomon , Keita Yokoyama

The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…

General Topology · Mathematics 2011-10-26 Quinton Westrich

An analogue over imaginary quadratic fields of a result in algebraic number theory known as Ihara's lemma is established. More precisely, we show that for a prime ideal P of the ring of integers of an imaginary quadratic field F, the kernel…

Number Theory · Mathematics 2007-08-23 Krzysztof Klosin

We parameterize the finite-dimensional irreducible representations of a class of pointed Hopf algebras over an algebraically closed field of characteristic zero by dominant characters. The Hopf algebras we are considering arise in the work…

Quantum Algebra · Mathematics 2007-05-23 David E. Radford , Hans-Jürgen Schneider

In this paper we study the isotypic decomposition of the regular module of a finite-dimensional Hopf algebra over an algebraically closed field of characteristic zero. For a semisimple Hopf algebra, the idempotents realizing the isotypic…

Quantum Algebra · Mathematics 2019-10-30 Vincent Koppen , Ehud Meir , Christoph Schweigert

Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.

Combinatorics · Mathematics 2025-11-24 Lorenzo Traldi

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

Formal Languages and Automata Theory · Computer Science 2024-07-02 Achim Blumensath

In this paper we prove that the homological dimension of an elementary amenable group over an arbitrary commutative coefficient ring is either infinite or equal to the Hirsch length of the group. Established theory gives simple group…

Group Theory · Mathematics 2019-02-26 Peter Kropholler , Conchita Martínez-Pérez

A pure topological characterization of primitive ideal spaces of separable nuclear C*-algebras is given. We show that a $T_0$-space $X$ is a primitive ideal space of a separable nuclear C*-algebra $A$ if and only if $X$ is point-complete…

Operator Algebras · Mathematics 2024-01-12 Hergen Harnisch , Eberhard Kirchberg

We prove that two finite prime $\Omega$-algebras defined over the same unital commutative ring and satisfying the same set of polynomial identities are isomorphic.

Rings and Algebras · Mathematics 2025-12-09 Yuri Bahturin , Daniela Martinez Correa , Diogo Diniz , Felipe Yasumura

We formalise the proof of the first case of Fermat's Last Theorem for regular primes using the \emph{Lean} theorem prover and its mathematical library \emph{mathlib}. This is an important 19th century result that motivated the development…

Logic in Computer Science · Computer Science 2023-05-23 Alex J. Best , Christopher Birkbeck , Riccardo Brasca , Eric Rodriguez Boidi

We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…

Rings and Algebras · Mathematics 2009-11-27 Laurent Bartholdi