arXiv subjects

Florian Deloup

Publications and source records attributed to Florian Deloup.

9 recordsLinked to original sources

arXiv2024

The decidability of the genus of regular languages and directed emulators

The article continues our study of the genus of a regular language $L$, defined as the minimal genus among all genera of all finite deterministic automata recognizing $L$. Here we define and study two closely related tools on a directed graph: directed emulators and automatic relations. A directed emulator morphism essentially encapsulates at the graph-theoretic level an epimorphism onto the minimal deterministic automaton. An automatic relation is the graph-theoretic version of the Myhill-Nerode relation. We show that an automatic relation determines a directed emulator morphism and respectively, a directed emulator morphism determines an automatic relation up to isomorphism. Consider the set $S$ of all directed emulators of the underlying directed graph of the minimal deterministic automaton for $L$. We prove that the genus of $L$ is $\underset{G \in S}{\min}\ g(G)$. We also consider the more restrictive notion of directed cover and prove that the genus of $L$ is reached in the class of directed covers of the underlying directed graph of the minimal deterministic automaton for $L$. This stands in sharp contrast to undirected emulators and undirected covers which we also consider. Finally we prove that if the problem of determining the minimal genus of a directed emulator of a directed graph has a solution then the problem of determining the minimal genus of an undirected emulator of an undirected graph has a solution.

cs.FL↗

arXiv2016

Decidability of regular language genus computation

The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular languages on a two-letter alphabet having arbitrary high genus. Let $L$ be a regular language. In order to understand the genus $g(L)$ of $L$, we introduce the topological size of $|L|_{\rm{top}}$ to be the minimal size of all finite deterministic automata of genus $g(L)$ computing $L$. We show that the minimal finite deterministic automaton of a regular language can be arbitrary far away from a finite deterministic automaton realizing the minimal genus and computing the same language, both in terms of the difference of genera and in terms of the difference in size. In particular, we show that the topological size $|L|_{\rm{top}}$ can grow at least exponentially in size $|L|$. We conjecture however the genus of every regular language to be computable. This conjecture implies in particular that the planarity of a regular language is decidable, a question asked in 1976 by R.V. Book and A.K. Chandra. We prove here the conjecture for a fairly generic class of regular languages having no short cycles.

cs.FL↗

arXiv2014

The genus of regular languages

The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus. After we introduce and justify the the notion of the genus for regular languages, the following questions are addressed. First, depending on the size of the alphabet, we provide upper and lower bounds on the genus of regular languages : we show that under a relatively generic condition on the alphabet and the geometry of the automata, the genus grows at least linearly in terms of the size of the automata. Second, we show that the topological cost of the powerset determinization procedure is exponential. Third, we prove that the notion of minimization is orthogonal to the notion of genus. Fourth, we build regular languages of arbitrary large genus: the notion of genus defines a proper hierarchy of regular languages.

cs.FL↗

arXiv2005

On Reciprocity

We prove a reciprocity formula between Gauss sums that is used in the computation of certain quantum invariants of 3-manifolds. Our proof uses the discriminant construction applied to the tensor product of lattices.

math.AC↗

arXiv2005

Monoide des enlacements et facteurs orthogonaux (Monoids of linking pairings and orthogonal summands)

A linking pairing is a symetric bilinear pairing lambda: GxG --> Q/Z on a finite abelian group. The set of isomorphism classes of linking pairings is a non-cancellative monoid E under orthogonal sum, which is infinitely generated and infinitely related. We propose a new presentation of E that enables one to detect whether a linking pairing has a given orthogonal summand. The same method extends to the monoid Q of quadratic forms on finite abelian groups. We obtain a combinatorial classification of Q (that was previously known for groups of period 4). As applications, we describe explicitly 3-manifolds having a degree one map onto prescribed (or proscribed) lens spaces. Most of the results extend to 3-manifolds endowed with a parallelization or a spin structure. In particular, the Reidemeister--Turaev function detects the existence of a spin preserving degree one map between a rational homology 3-sphere and a lens space.

math.GT↗

arXiv2005

Palindromes and orderings in Artin groups

The braid group $B_{n}$, endowed with Artin's presentation, admits two distinguished involutions. One is the anti-automorphism ${\rm{rev}}: B_{n} \to B_{n}$, $v \mapsto \bar{v}$, defined by reading braids in the reverse order (from right to left instead of left to right). Another one is the conjugation $τ:x \mapsto Δ^{-1}x Δ$ by the generalized half-twist (Garside element). More generally, the involution ${\rm{rev}}$ is defined for all Artin groups (equipped with Artin's presentation) and the involution $τ$ is defined for all Artin groups of finite type. A palindrome is an element invariant under rev. We classify palindromes and palindromes invariant under $τ$ in Artin groups of finite type. The tools are elementary rewriting and the construction of explicit left-orderings compatible with rev. Finally, we discuss generalizations to Artin groups of infinite type and Garside groups.

math.GT↗

arXiv2004

Quadratic functions and complex spin structures on three-manifolds

We show how the space of complex spin structures of a closed oriented three-manifold embeds naturally into a space of quadratic functions associated to its linking pairing. Besides, we extend the Goussarov-Habiro theory of finite type invariants to the realm of compact oriented three-manifolds equipped with a complex spin structure. Our main result states that two closed oriented three-manifolds endowed with a complex spin structure are undistinguishable by complex spin invariants of degree zero if, and only if, their associated quadratic functions are isomorphic.

math.GT↗

arXiv2004

Quadratic functions on torsion groups

We investigate classification results for general quadratic functions on torsion abelian groups. Unlike the previously studied situations, general quadratic functions are allowed to be inhomogeneous or degenerate. We study the discriminant construction which assigns, to an integral lattice with a distinguished characteristic form, a quadratic function on a torsion group. When the associated symmetric bilinear pairing is fixed, we construct an affine embedding of a quotient of the set of characteristic forms into the set of all quadratic functions and determine explicitly its cokernel. We determine a suitable class of torsion groups so that quadratic functions defined on them are classified by the stable class of their lift. This refines results due to A.H. Durfee, V. Nikulin, C.T.C. Wall and E. Looijenga -- J. Wahl. Finally, we show that on this class of torsion groups, two quadratic functions are isomorphic if and only if they have equal associated Gauss sums and there is an isomorphism between the associated symmetric bilinear pairings which preserves the "homogeneity defects". This generalizes a classical result due to V. Nikulin. Our results are elementary in nature and motivated by low-dimensional topology.

math.AC↗

arXiv2003

Reidemeister-Turaev torsion modulo one of rational homology three-spheres

Given an oriented rational homology 3-sphere M, it is known how to associate to any Spin^c-structure σon M two quadratic functions over the linking pairing. One quadratic function is derived from the reduction modulo 1 of the Reidemeister-Turaev torsion of (M,σ), while the other one can be defined using the intersection pairing of an appropriate compact oriented 4-manifold with boundary M. In this paper, using surgery presentations of the manifold M, we prove that those two quadratic functions coincide. Our proof relies on the comparison between two distinct combinatorial descriptions of Spin^c-structures on M Turaev's charges vs Chern vectors.

math.GT↗