Related papers: Automata in toposes, and general Myhill-Nerode the…
We provide an algebraic perspective on Nielsen--Ninomiya-type no-go theorems arising from group cohomological anomalies, revisiting in particular the version proved by Kapustin and Sopenko. Departing from their analytic proof, our approach…
Nikol'skii known theorem for the kernels satisfying a condition $A^*_n$, is proved and for kernels from wider class. Explicit formulas for calculating the value of an approximation of classes $\W^{r, \beta}_{p, n} $ by convolution operators…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
The atoms of the Schanuel topos can be described as the pairs $(n,G)$ where $n$ is a finite set and $G$ is a subgroup of $\operatorname{Aut}(n)$. We give a general criterion on an atomic site ensuring that the atoms of the topos of sheaves…
We prove, for an arbitrary finite root system, the periodicity conjecture of Al.B.Zamolodchikov concerning Y-systems, a particular class of functional relations arising in the theory of thermodynamic Bethe ansatz. Algebraically, Y-systems…
Arithmetic root systems are invariants of Nichols algebras of diagonal type with a certain finiteness property. They can also be considered as generalizations of ordinary root systems with rich structure and many new examples. On the other…
We review the notion of reducibility and we introduce and discuss the notion of orbital reducibility for autonomous ordinary differential equations of first order. The relation between (orbital) reducibility and (orbital) symmetry is…
In this paper we introduce the notion of dynamical systems over the class of the normed real nonassociative algebras not necessarily finite-dimensional, generalize the classical filled Julia and Mandelbrot sets over the complex numbers,…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
In this paper we introduce the notion of an operator category and two different models for homotopy theory of $\infty$-operads over an operator category -- one of which extends Lurie's theory of $\infty$-operads, the other of which is…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
Building on the mapping relations between analytic functions and periodic functions using the abstract operators $\cos(h\partial_x)$ and $\sin(h\partial_x)$, and by defining the Zeta and related functions including the Hurwitz Zeta function…
Finite automata are used to encode geometric figures, functions and can be used for image compression and processing. The original approach is to represent each point of a figure in $\mathbb{R}^n$ as a convolution of its $n$ coordinates…
In this paper we show that classical notions from automata theory such as simulation and bisimulation can be lifted to the context of enriched categories. The usual properties of bisimulation are nearly all preserved in this new context.…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…
We present a systematic methodology to determine and locate analytically isolated periodic points of discrete and continuous dynamical systems with algebraic nature. We apply this method to a wide range of examples, including a…
We construct nontrivial auto-equivalences of stable module categories for elementary, local symmetric algebras over a field k. These auto-equivalences are modeled after the spherical twists of Seidel and Thomas and the $\mathbb{P}^n$-twists…