Related papers: Reset thresholds of transformation monoids
We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of…
We establish upper bounds for shifted moments of modular $L$-functions to a fixed modulus as well as quadratic twists of modular $L$-functions under the generalized Riemann hypothesis. Our results are then used to establish bounds for…
In this paper we establish an abstraction of on-the-fly determinization of finite-state automata using transition monoids and demonstrate how it can be applied to bound the asymptotics. We present algebraic and combinatorial properties that…
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This…
We prove exponential contraction of renormalization along hybrid classes of infinitely renormalizable unimodal maps (with arbitrary combinatorics), in any even degree $d$. We then conclude that orbits of renormalization are asymptotic to…
We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…
We give a simple optimistic algorithm for which it is easy to derive regret bounds of $\tilde{O}(\sqrt{t_{\rm mix} SAT})$ after $T$ steps in uniformly ergodic Markov decision processes with $S$ states, $A$ actions, and mixing time parameter…
An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…
We establish a new, fairly general cancellativity criterion for a presented monoid that properly extends the previously known related criteria. It is based on a new version of the word transformation called factor reversing, and its…
In this note we establish some connections between the theory of self-similar fractals in the sense of John E. Hutchinson (cf. [3]) and the theory of boundary quotients of $C^\ast$-algebras associated to monoids. Although we must leave…
We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free…
Starting with a highest weight representation of a Kac-Moody group over the complex numbers, we construct a monoid whose unit group is the image of the Kac-Moody group under the representation, multiplied by the nonzero complex numbers. We…
Starting with a highest weight representation of a Kac-Moody group over the complex numbers, we construct a monoid whose unit group is the image of the Kac-Moody group under the representation, multiplied by the nonzero complex numbers. We…
The largest known reset thresholds for DFAs are equal to $(n-1)^2$, where $n$ is the number of states. This is conjectured to be the maximum possible. PFAs (with partial transition function) can have exponentially large reset thresholds.…
The rational representation theory of a reductive normal algebraic monoid (with one-dimensional center) forms a highest weight category, in the sense of Cline, Parshall, and Scott. This is a fundamental fact about the representation theory…
A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…
The determinisation problem for min-plus (tropical) weighted automata was recently shown to be decidable. However, the proof is purely existential, relying on several non-constructive arguments. Our contribution in this work is twofold:…
The well known open \v{C}ern\'y conjecture states that each \san with $n$ states has a \sw of length at most $(n-1)^2$. On the other hand, the best known upper bound is cubic of $n$. Recently, in the paper \cite{CARPI1} of Alessandro and…
We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of…