Related papers: Characterizing classes of regular languages using …

In this article, we introduce the normal category L(S) [R(S)] of principal left [right] ideals of the normed algebra S of all finite rank bounded operators on a Hilbert space H and is shown that they are isomorphic, using Hilbert space…

Let X be a 2-sphere with n punctures. We classify all conjugacy classes of Zariski-dense representations $$\rho: \pi_1(X)\to SL_2(\mathbb{C})$$ with finite orbit under the mapping class group of X, such that the local monodromy at one or…

Stability of synchronization in delay-coupled networks of identical units generally depends in a complicated way on the coupling topology. We show that for large coupling delays synchronizability relates in a simple way to the spectral…

A celebrated result of Sch\"utzenberger says that a language is star-free if and only if it is is recognized by a finite aperiodic monoid. We give a new proof for this theorem using local divisors.

We consider a class of multiparameter singular Radon integral operators on the Heisenberg group ${\mathbb H}^1$ where the underlying variety is the graph of a polynomial. A remarkable difference with the euclidean case, where Heisenberg…

In this paper we prove that maximal H-monotone operators $T:H^n\rightrightarrows V_1$ whose domain is all the Heisenberg group $H^n$ are locally bounded. This implies that they are upper semicontinuous. As a consequence, maximal…

We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-BSS in short) and develop a Fagin-type logical characterisation for languages decidable in non-deterministic polynomial time by S-BSS machines. We show…

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

In his proof of the K(pi,1) conjecture for complex reflection arrangements, Bessis defined Garside categories suitable for studying braid groups of centralizers of Springer regular elements in well-generated complex reflection groups. We…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Algorithmic issues concerning Elliott local semigroups are seldom considered in the literature, although these combinatorial structures completely classify AF algebras. In general, the addition operation of an Elliott local semigroup is…

For any branched double covering of compact Riemann surfaces, we consider the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We restrict the…

Spatial differentiability of solutions of stochastic differential equations (SDEs) is a classical question in stochastic analysis. The case of coefficients with globally Lipschitz continuous derivatives is well understood in the literature.…

Hessenberg varieties are subvarieties of the flag variety parametrized by a linear operator $X$ and a nondecreasing function $h$. The family of Hessenberg varieties for regular $X$ is particularly important: they are used in quantum…

The first author showed in a previous paper that there is a correspondence between self-similar group actions and a class of left cancellative monoids called left Rees monoids. These monoids can be constructed either directly from the…

We prove a rank-finiteness conjecture for modular categories: up to equivalence, there are only finitely many modular categories of any fixed rank. Our technical advance is a generalization of the Cauchy theorem in group theory to the…

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…

The codewords of the homomorphism code $\operatorname{aHom}(G,H)$ are the affine homomorphisms between two finite groups, $G$ and $H$, generalizing Hadamard codes. Following the work of Goldreich--Levin (1989), Grigorescu et al. (2006),…

This paper deals with the problem of recognizability of functions l: Sigma* --> M that map words to values in the support set M of a monoid (M,.,1). These functions are called M-languages. M-languages are studied from the aspect of their…

We exhibit explicit and easily realisable bijections between Hecke--Kiselman monoids of type $A_n$/$\widetilde{A}_n$; certain braid diagrams on the plane/cylinder; and couples of integer sequences of particular types. This yields a fast…