Related papers: The algebra of row monomial matrices
For the word $\omega = \underbrace{11\ldots 1}_{x_1}\underbrace{22\ldots2}_{x_2}\ldots\underbrace{nn\ldots n}_{x_n},$ denote by $\mathsf{A}(x_1, x_2, \ldots, x_n)$ the number of its anagrams without fixed letters. While the function…
We completely classify Fourier summation formulas of the form $$ \int_{\mathbb{R}} \widehat{\varphi}(t) d\mu(t)=\sum_{n=0}^{\infty} a(\lambda_n)\varphi(\lambda_n), $$ that hold for any test function $\varphi$, where $\widehat\varphi$ is the…
It was conjectured by \v{C}ern\'y in 1964, that a synchronizing DFA on $n$ states always has a synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached. Until now a full analysis of all…
Let $\mathscr{A}$ be a nonempty set of infinite matrices of linear operators between two topological vector spaces. We show that a sequence is uniformly $\mathscr{A}$-summable if and only if it is $B$-summable for all matrices $B$ of linear…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
A differential category is an additive symmetric monoidal category, that is, a symmetric monoidal category enriched over commutative monoids, with an algebra modality, axiomatizing smooth functions, and a deriving transformation on this…
Algebraic dichotomy is a generalization of an exponential dichotomy (Lin, JDE2009). This paper gives a version of Hartman-Grobman linearization theorem assuming that linear system admits an algebraic dichotomy, which generalizes the…
We prove that a random automaton with $n$ states and any fixed non-singleton alphabet is synchronizing with high probability (modulo an unpublished result about unique highest trees of random graphs). Moreover, we also prove that the…
Assume that $X= {x_1,...,x_g}$ is a finite alphabet and $K$ is a field. We study monomial algebras $A= K <X> /(W)$, where $W$ is an antichain of Lyndon words in $X$ of arbitrary cardinality. We find a Poincar\'{e}-Birkhoff-Witt type basis…
An index for a finite automaton is a powerful data structure that supports locating paths labeled with a query pattern, thus solving pattern matching on the underlying regular language. In this paper, we solve the long-standing problem of…
Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
We study operator algebras arising from monomial ideals in the ring of polynomials in noncommuting variables, through the apparatus of subproduct systems and C*-correspondences. We provide a full comparison amongst the related operator…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
We study the problem of matrix Lie algebra conjugacy. Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley--Sohoni Geometric Complexity Theory program. A matrix Lie…
In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that \v{C}ern\'y's conjecture generalizes to CNFAs and that the general upper bound for the length of…
A rationally dynamically algebraic (RDA) power series is one that arises as (a component of) the solution of a system of differential equations of the form $\boldsymbol{y}' = F(\boldsymbol{y})$, where $F$ is a vector of rational functions…
A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…