English
Related papers

Related papers: Reset thresholds of transformation monoids

200 papers

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…

Formal Languages and Automata Theory · Computer Science 2026-02-11 Hugo Bazille , Uli Fahrenberg

We extend the Moran model with single-crossover recombination to include general recombination and mutation. We show that, in the case without resampling, the expectations of products of marginal processes defined via partitions of sites…

Probability · Mathematics 2012-06-06 Ellen Baake , Thiemo Hustedt

Say that a cone is a commutative monoid in which x+y=0 implies that x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind,…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

We develop the idea of a supersymmetric monoidal supercategory, following ideas of Kapranov. Roughly, this is a monoidal category in which the objects and morphisms are ${\bf Z}/2$-graded, equipped with isomorphisms $X \otimes Y \to Y…

Category Theory · Mathematics 2021-02-16 Steven V Sam , Andrew Snowden

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…

Combinatorics · Mathematics 2024-12-06 Anton Dochtermann , Ritika Nair , Jay Schweig , Adam Van Tuyl , Russ Woodroofe

Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by…

Formal Languages and Automata Theory · Computer Science 2010-06-09 Miklós Bartha

We study the action of monads on categories equipped with several monoidal structures. We identify the structure and conditions that guarantee that the higher monoidal structure is inherited by the category of algebras over the monad.…

Category Theory · Mathematics 2017-01-12 Marcelo Aguiar , Mariana Haim , Ignacio Lopez Franco

Let $R=k[x_1, ..., x_n]$ be a polynomial ring and let $I\subset R$ be a graded ideal. In \cite{R}, R\"{o}mer asked whether under the Cohen-Macaulay assumption the $i$-th Betti number $\beta_{i}(R/I)$ can be bounded above by a function of…

Commutative Algebra · Mathematics 2007-05-23 Rosa M. Miró-Roig

We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.

Number Theory · Mathematics 2013-07-10 Joshua Zelinsky

We develop the theory of truncated wedge schemes, a higher dimensional analog of jet schemes. We prove some basic properties and give an irreducibility criterion for truncated wedge schemes of a locally complete intersection variety…

Algebraic Geometry · Mathematics 2007-05-23 Cornelia Yuen

We extend Grood's tableau construction of irreducible representations of the rook monoid and Steinberg's analogous result for the full transformation monoid. Our approach is characteristic-free and applies to any submonoid $\mathcal{M}(n)$…

Representation Theory · Mathematics 2025-12-30 Mihalis Maliakas , Dimitra-Dionysia Stergiopoulou

This is a straightforward generalization Section 2 of arXiv:1805.11167. It shows that for a residual set of transformations in the space of measure preserving transformations, with the weak topology, any self-joining defines a Markov…

Dynamical Systems · Mathematics 2019-01-28 Jon Chaika

We prove the existence of a 1/N expansion to all orders in beta matrix models with a confining, off-critical potential corresponding to an equilibrium measure with a connected support. Thus, the coefficients of the expansion can be obtained…

Probability · Mathematics 2015-05-28 Gaëtan Borot , Alice Guionnet

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

Dynamical Systems · Mathematics 2007-05-23 Marianne Akian , Stephane Gaubert , Bas Lemmens , Roger Nussbaum

We define the notion of canonical boundedness among rank-one transformations and use it to characterize the class of all bounded rank-one transformations with trivial centralizer. We also explicitly characterize totally ergodic rank-one…

Dynamical Systems · Mathematics 2013-09-10 Su Gao , Aaron Hill

In this article we extend the theory of lax monoidal structures, also known as multitensors, and the monads on categories of enriched graphs that they give rise to. Our first principal result -- the lifting theorem for multitensors --…

Category Theory · Mathematics 2013-09-18 Michael Batanin , Denis-Charles Cisinski , Mark Weber

We describe the automorphism groups of reductive monoids and of root monoids with active groups of invertible elements.

Algebraic Geometry · Mathematics 2026-05-13 Anton Shafarevich

We explore an alternative definition of unit in a monoidal category originally due to Saavedra: a Saavedra unit is a cancellative idempotent (in a 1-categorical sense). This notion is more economical than the usual notion in terms of…

Category Theory · Mathematics 2010-03-09 Joachim Kock

Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…

Logic in Computer Science · Computer Science 2007-05-23 André Hirschowitz , Marco Maggesi

Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…

Computational Complexity · Computer Science 2022-03-08 Matthias Christandl , Péter Vrana , Jeroen Zuiddam