Related papers: Some properties of B\"uchi Arithmetics

In this work, we exploit the power of \emph{finite ambiguity} for the complementation problem of B\"uchi automata by using reduced run directed acyclic graphs (DAGs) over infinite words, in which each vertex has at most one predecessor;…

Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be…

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…

Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…

Motivated by the recent developments of de Branges-Rovnyak spaces, we investigate the function theoretic aspects of finite rank de Branges-Rovnyak spaces $H(B)$ generated by row-valued Schur functions $B$. We provide a generalization of…

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

We characterize unitary representations of braid groups $B_n$ of degree linear in $n$ and finite images of such representations of degree exponential in $n$.

A rack of order $n$ is a binary operation $\rack$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all…

Bayesian networks (BNs) are graphical \emph{first-order} probabilistic models that allow for a compact representation of large probability distributions, and for efficient inference, both exact and approximate. We introduce a…

The condensation rank associates any topological space with a unique ordinal number. In this paper we prove that the condensation rank of any infinite dimensional injective Banach space is equal to or greater than the first uncountable…

Let $\Bc$ denote the real-valued functions continuous on the extended real line and vanishing at $-\infty$. Let $\Br$ denote the functions that are left continuous, have a right limit at each point and vanish at $-\infty$. Define $\acn$ to…

Complementation of nondeterministic B\"uchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis of programs, model checking, or in decision procedures of…

We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…

We introduce a certain restriction of weighted automata over the rationals, called image-binary automata. We show that such automata accept the regular languages, can be exponentially more succinct than corresponding NFAs, and allow for…

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

The $A$-partition function $p_A(n)$ enumerates those partitions of $n$ whose parts belong to a fixed (finite or infinite) set $A$ of positive integers. On the other hand, the extended $A$-partition function…

Parikh's Theorem is a fundamental result in automata theory with numerous applications in computer science: software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic…

The theory of ordinal ranks on Baire class 1 functions developed by Kechris and Loveau was recently extended by Elekes, Kiss and Vidny\'{a}nszky to Baire class $\xi$ functions for any countable ordinal $\xi\geq1$. In this paper, we answer…

This note aims to highlight the link between representable functionals and derivations on a Banach quasi *-algebra, i.e. a mathematical structure that can be seen as the completion of a normed *-algebra in the case the multiplication is…

Let $\ord$ be the maximal order of a number field. Belcher showed in the 1970s that every algebraic integer in $\ord$ is the sum of pairwise distinct units, if the unit equation $u+v=2$ has a non-trivial solution $u,v\in\ord^*$. We…