Related papers: (k,l)-Unambiguity and Quasi-Deterministic Structur…
We study the representation theory of the infinite type A Hecke algebra over a non-archimedean field in the case where the parameter is a pseudo-uniformizer. Specifically, we consider a family of representations, called almost-symmetric,…
The pairs $(\mathcal{D},G)$, where $\mathcal{D}$ is a non-trivial $2$-$(k^{2},k,\lambda )$ design, with $\lambda \mid k$, and $G$ is a flag-transitive automorphism group of $\mathcal{D}$ of affine type such that $G \nleq A \Gamma…
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete,real-time and probabilistic systems. We have observed a lot of shared algebraic structure between these formalisms.…
Deterministic and nondeterministic finite automata with translucent letters were introduced by Nagy and Otto more than a decade ago as Cooperative Distributed systems of a kind of stateless restarting automata with window size one. These…
We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA) B that recognizes an abstraction of the language L(A): its…
It is proved that the assembly map in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups $\Gamma$ with finite quotient finite decomposition complexity (a strengthening of finite decomposition…
Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is…
We show that if a field k contains sufficiently many elements(for instance, if k is infinite), and K is an algebraically closed field containing k, then every linear algebraic k-group over K is k-isomorphic to Aut(A\otimes_kK), where A is a…
Some new infinite families of simple, indecomposable $m$-factorizations of the complete multigraph $\lambda K_v$ are presented. Most of the constructions come from finite geometries.
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
Let k be a commutative ring. We find and characterize a new family of twisted planes (i. e. associative unitary k-algebra structures on the k-module k[X,Y], having k[X] and and k[Y] as subalgebras).Similar results are obtained for the…
We show that $\mathbb{Q}$-Fano varieties of fixed dimension with anti-canonical degrees and alpha-invariants bounded from below form a bounded family. As a corollary, K-semistable $\mathbb{Q}$-Fano varieties of fixed dimension with…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
Let $A$ be a finite-dimensional associative $k$-algebra with identity. The primary aim of this paper is to study the rationality properties of the group of all $k$-algebra automorphisms of $A$, as an affine algebraic group over an arbitrary…
Absract It is proposed that there exist, within a new $SU(2)^{'}$, a gauged discrete group $Q_6$ (the order 12 double dihedral group) acting as a family symmetry. This nonabelian finite group can explain hierarchical features of families,…
We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…
Lately, there have been intensive studies on strengths and limitations of nonuniform families of promise decision problems solvable by various types of polynomial-size finite automata families, where ``polynomial-size'' refers to the…
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular…