English
Related papers

Related papers: Series which are both max-plus and min-plus ration…

200 papers

We prove that if two finite metacyclic groups have isomorphic rational group algebras, then they are isomorphic. This contributes to understand where is the line separating positive and negative solutions to the Isomorphism Problem for…

Group Theory · Mathematics 2025-02-20 Ángel del Río , Àngel García-Blázquez

We provide a countable series of bisimple $\mathcal{H}$-trivial finitely presented congruence-free monoids.

Group Theory · Mathematics 2013-01-24 Victor Maltcev

We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…

Combinatorics · Mathematics 2024-10-22 Usman Ali , Iffat Fida Hussain

We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…

Group Theory · Mathematics 2018-12-06 Matthieu Picantin

A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…

Number Theory · Mathematics 2025-05-05 Shaver Phagan

We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove…

Formal Languages and Automata Theory · Computer Science 2021-04-27 Piotr Hofman , Marta Juzepczuk , Sławomir Lasota , Mohnish Pattathurajan

We construct two new families of basis for finite field extensions. Basis in the first family, the so-called elliptic basis, are not quite normal basis, but they allow very fast Frobenius exponentiation while preserving sparse…

Number Theory · Mathematics 2012-05-07 Jean-Marc Couveignes , Reynald Lercier

These notes present an approach to obtaining monoid operations which are compatible with a given family of mappings in the sense that the mappings become left translations in the monoid. This can be applied to various situations such as the…

History and Overview · Mathematics 2010-08-03 Chris Preston

If $R$ is a rational map, the Main Result is a uniformization Theorem for the space of decompositions of the iterates of $R$. Secondly, we show that Fatou conjecture holds for decomposable rational maps.

Dynamical Systems · Mathematics 2011-07-01 Carlos Cabrera , Peter Makienko

We construct a family of rational map sequences providing an arbitrary large number of dynamically independent rescaling limits of non monomial type. From this, we deduce the existence of a family of rational maps providing a non trivial…

Dynamical Systems · Mathematics 2016-07-01 Matthieu Arfeux , Guizhen Cui

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

Group Theory · Mathematics 2021-05-26 Pierre Fima , Soyoung Moon , Yves Stalder

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

Number Theory · Mathematics 2022-11-03 Chun Yin Hui

The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent to a deterministic one. Furthermore,…

Formal Languages and Automata Theory · Computer Science 2026-01-13 Jason P. Bell , Daniel Smertnig

In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…

Logic in Computer Science · Computer Science 2017-01-11 Francois Lamarche , Lutz Strassburger

We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra…

Commutative Algebra · Mathematics 2026-04-02 Laura González , Francesc Planas-Vilanova

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

Group Theory · Mathematics 2019-05-21 Cecil Andrew Ellard

We prove the irrationality of some factorial series. To do so we combine methods from elementary and analytic number theory with methods from the theory of uniform distribution.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

In this article we prove a result comparing rationality of algebraic cycles over the function field of a projective homogeneous variety under a linear algebraic group of type $F_4$ or $E_8$ and over the base field, which can be of any…

Algebraic Geometry · Mathematics 2013-06-06 Raphael Fino

In this work, the concept of mutually unbiased frames is introduced as the most general notion of unbiasedness for sets composed by linearly independent and normalized vectors. It encompasses the already existing notions of unbiasedness for…

Quantum Physics · Physics 2022-11-09 F. Caro Perez , V. Gonzalez Avella , D. Goyeneche

We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…

Formal Languages and Automata Theory · Computer Science 2019-08-13 Corentin Barloy , Nathanaël Fijalkow , Nathan Lhote , Filip Mazowiecki