Related papers: A Topological proof that $O_2$ is $2$-MCFL

Let $X$ be an Abelian group of the form $X=\mathbb{R}^m\times K\times D$, where $m\geq 0$, $K$ is a compact totally disconnected group of the special form, $D$ is a discrete group. Let $\xi_i, i=1,2,...,n,n\geq 2,$ be independent random…

We prove that |A^n| > c_n |A|^{[\frac{n+1}{2}]} for any finite subset A of a free group if A contains at least two noncommuting elements, where c_n>0 are constants not depending on A. Simple examples show that the order of these estimates…

We study the language-theoretic properties of the word problem, in the sense of Duncan & Gilman, of weakly compressible monoids, as defined by Adian & Oganesian. We show that if $\mathcal{C}$ is a reversal-closed super-$\operatorname{AFL}$,…

We solve the word problem for free double categories without equations between generators by translating it to the word problem for 2-categories. This yields a quadratic algorithm deciding the equality of diagrams in a free double category.…

Let $F$ be a non-archimedean local field of characteristic not equal to 2. In this paper, we prove the local converse theorem for quasi-split $\O_{2n}(F)$ and $\SO_{2n}(F)$, via the description of the local theta correspondence between…

We consider fragments of first-order logic and as models we allow finite and infinite words simultaneously. The only binary relations apart from equality are order comparison < and the successor predicate +1. We give characterizations of…

Strongly zero-dimensional topological groups $G_1$, $G_2$, and $G$ such that $G_1\times G_2$ has positive covering dimension and $G$ contains a closed subgroup of positive covering dimension are constructed. Moreover, all finite powers of…

In the (2+2) formulation of general relativity spacetime is foliated by a two-parameter family of spacelike 2-surfaces (instead of the more usual one-parameter family of spacelike 3-surfaces). In a partially gauge-fixed setting (double-null…

In this paper, we prove the semidecidability of the problem of saying whether or not a context-free grammar generates a regular language. We introduce the notion of context-free grammar in Marciani Normal Form. We prove that a context-free…

Context-free language (CFL) reachability is a standard approach in static analyses, where the analysis question is phrased as a language reachability problem on a graph $G$ wrt a CFL L. While CFLs lack the expressiveness needed for high…

We extend a dichotomy between 1-basedness and supersimplicity proved in a previous paper. The generalization we get is to arbitrary language, with no restrictions on the topology (we do not demand type-definabilty of the open set in the…

The results of Culler and Shalen for 2,3 or 4-free hyperbolic 3-manifolds are contingent on properties specific to and special about rank two subgroups of a free group. Here we determine what construction and algebraic information is…

In a number of recent works, it has been established that many virtually free groups, almost all fundamental groups of surfaces and all groups which are nontrivial free products of groups satisfying a non-trivial law are algebraically…

We discuss the computational complexity of context-free languages, concentrating on two well-known structural properties---immunity and pseudorandomness. An infinite language is REG-immune (resp., CFL-immune) if it contains no infinite…

The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…

We provide an infinite family of sofic one-relator groups that are not residually solvable nor residually finite. The proof is essentially different from the one in [1], as it does not require just Magnus' decompositions.

In this article, the disjunction-free fragment of Ja\'skowski's discussive logic D2 in the language of classical logic is shown to be complete with respect to three- and four-valued semantics. As a byproduct, a rather simple axiomatization…

We consider words over a binary alphabet. A word $w$ is overlap-free if it does not have factors (blocks of consecutive letters) of the form $uvuvu$ for nonempty $u$. Let $M(w)$ denote the number of positions that are middle positions of…

We construct the finite-dimensional continuous complex representations of $\mathrm{SL}_2$ over compact discrete valuation rings of even residual characteristic. We also prove that the complex group algebras of $\mathrm{SL}_2$ over finite…