English
Related papers

Related papers: On Theta-palindromic Richness

200 papers

Let T be a tilting object in a triangulated category equivalent to the bounded derived category of a hereditary abelian category with finite dimensional homomorphism spaces and split idempotents. This text investigates the strong global…

Representation Theory · Mathematics 2017-03-17 Edson Ribeiro Alvares , Patrick Le Meur , Eduardo N. Marcos

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Richard Mandel , Corto Mascle , Georg Zetzsche

We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.

Computational Complexity · Computer Science 2007-05-23 M. V. Panduranga Rao

We present norm criteria for the existence of anti-automorphisms, as well as explicit constructions of anti-automorphisms, both on cyclic and generalized cyclic algebras. Our approach describes anti-automorphisms as polynomial maps and…

Rings and Algebras · Mathematics 2026-05-28 Susanne Pumpluen

Thom polynomials are universal cohomological obstructions to the appearance of singularities of given types in differentiable maps. As an application, various invariants of immersions have been expressed in terms of singularities of their…

Geometric Topology · Mathematics 2026-05-27 Masato Tanabe

M. Hochster defines an invariant namely $\Theta(M,N)$ associated to two finitely generated module over a hyper-surface ring $R=P/f$, where $P=k\{x_0,...,x_n\}$ or $k[X_0,...,x_n]$, for $k$ a field and $f$ is a germ of holomorphic function…

Algebraic Geometry · Mathematics 2017-02-10 Mohammad Reza Rahmati

Let $X$ be an irreducible shift of finite type (SFT) of positive entropy, and let $B_n(X)$ be its set of words of length $n$. Define a random subset $\omega$ of $B_n(X)$ by independently choosing each word from $B_n(X)$ with some…

Probability · Mathematics 2012-04-09 Kevin McGoff

We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…

Combinatorics · Mathematics 2025-08-26 Be'eri Greenfeld , Carlos Gustavo Moreira , Efim Zelmanov

In this paper, we interpret the theta rank of an irreducible character of a finite classical group in terms of the data from the Lusztig classification. Then we prove the following two results: (1) the agreement of the $U$-rank and the…

Representation Theory · Mathematics 2021-10-20 Shu-Yen Pan

It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…

Combinatorics · Mathematics 2007-05-23 F. Vaccarino

We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and…

Combinatorics · Mathematics 2025-06-06 Eva Foster , Aleksi Saarela , Aleksi Vanhatalo

Let $X$ be a two-sided subshift on a finite alphabet endowed with a mixing probability measure which is positive on all cylinders in $X$. We show that there exist arbitrarily small finite overlapping union of shifted cylinders which…

Dynamical Systems · Mathematics 2018-09-12 Kevin G. Hare , Nikita Sidorov

Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…

Combinatorics · Mathematics 2017-04-28 Mikael Hansson , Axel Hultman

Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…

Logic · Mathematics 2020-05-26 T. Moraschini , J. G. Raftery , J. J. Wannenburg

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

Group Theory · Mathematics 2024-12-05 Jonathan Warne

We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and S{\l}omczy{\'n}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is…

Rings and Algebras · Mathematics 2026-04-01 Erhard Aichinger , Mario Kapl , Bernardo Rossi

The Thom polynomial of a singularity $\eta$ expresses the cohomology class of the $\eta$-singularity locus of a map in terms of the map's simple invariants. In this informal survey -- based on two lectures given at the Isaac Newton…

Algebraic Geometry · Mathematics 2024-07-22 Richard Rimanyi

In this article, we construct countably many mutually non-isotopic diffeomorphisms of some closed non simply-connected 4-manifolds that are homotopic to but not isotopic to the identity, by surgery along $\Theta$-graphs. As corollaries of…

Geometric Topology · Mathematics 2023-02-24 Tadayuki Watanabe

The two operations, deletion and contraction of an edge, on multigraphs directly lead to the Tutte polynomial which satisfies a universal problem. As observed by Brylawski in terms of order relations, these operations may be interpreted as…

Discrete Mathematics · Computer Science 2013-03-08 Laurent Poinsot

We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…

Combinatorics · Mathematics 2021-07-06 David M. Evans , Jan Hubička , Jaroslav Nešetřil