Related papers: The Frobenius problem for the shuffle operation
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…
We investigate the state complexity of the shuffle operation on regular languages initiated by Campeanu et al. and studied subsequently by Brzozowski et al. We shift the problem into the combinatorics domain by turning the problem of state…
We consider two natural problems about nondeterministic finite automata. First, given such an automaton M of n states, and a length l, does M accept a word of length l? We show that the classic problem of triangle-free graph recognition…
Two classical rings of invariants are shown to be Frobenius split: for the special linear group acting on the direct sum of several copies of the defining representation and several copies of the dual of the defining representation; and for…
We study the action of the infinite Frobenius on the de Rham fundamental groups of affine curves defined over $\bfR$. As an application, we compute extension classes of real mixed Hodge structures associated with the motivic fundamental…
The goal of this paper is to provide exact and terminating algorithms for the formal analysis of deterministic continuous-time control systems with affine input and polynomial state dynamics (in short, polynomial systems). We consider the…
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of…
Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.
In this paper, as a main theorem, we prove that the decision version of the Frobenius problem is Sigma_2^P-complete under Karp reductions.Given a finite set A of coprime positive integers, we call the greatest integer that cannot be…
Let $H$ be a connected spherical subgroup of a semisimple algebraic group $G$. In this paper, we give a criterion for $H$-orbit closures in the flag variety of $G$ to have nice geometric and cohomological properties. Our main tool is the…
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we…
We carry on the study of the synthesis problem on data words for fragments of first order logic, and delineate precisely the border between decidability and undecidability.
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We determine the maximal length of the period of a periodic word defined by $n$ restrictions. It happens to be the corresponding Fibonacci number.
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A…
We study the Frobenius problem: given relatively prime positive integers $a_1,...,a_d$, find the largest value of t (the Frobenius number) such that $\sum_{k=1}^d m_k a_k = t$ has no solution in nonnegative integers $m_1,...,m_d$. Based on…