English
Related papers

Related papers: Characterizing classes of regular languages using …

200 papers

We consider the following two finiteness conditions on normalizers and centralizers in a group G: (i) |N_G(H):H| is finite for every non-normal subgroup H of G, and (ii) |C_G(x):<x>| is finite for every non-normal cyclic subgroup <x> of G.…

Group Theory · Mathematics 2016-01-14 Gustavo A. Fernandez-Alcober , Leire Legarreta , Antonio Tortora , Maria Tota

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

Combinatorics · Mathematics 2023-11-28 Jennifer Elder

Subgraph and homomorphism counting are fundamental algorithmic problems. Given a constant-sized pattern graph $H$ and a large input graph $G$, we wish to count the number of $H$-homomorphisms/subgraphs in $G$. Given the massive sizes of…

Data Structures and Algorithms · Computer Science 2023-11-17 Daniel Paul-Pena , C. Seshadhri

Mutually Uncorrelated (MU) codes are a class of codes in which no proper prefix of one codeword is a suffix of another codeword. These codes were originally studied for synchronization purposes and recently, Yazdi et al. showed their…

Information Theory · Computer Science 2018-04-17 Maya Levy , Eitan Yaakobi

We associate a graded monoidal supercategory $\mathcal{H}\mathit{eis}_{F,k}$ to every graded Frobenius superalgebra $F$ and integer $k$. These categories, which categorify a broad range of lattice Heisenberg algebras, recover many…

Representation Theory · Mathematics 2020-06-05 Alistair Savage

In this paper, we study the finite satisfiability problem for the logic BE under the homogeneity assumption. BE is the cornerstone of Halpern and Shoham's interval temporal logic, and features modal operators corresponding to the prefix…

Logic in Computer Science · Computer Science 2023-04-25 Dario Della Monica , Angelo Montanari , Gabriele Puppis , Pietro Sala

We investigate certain singular integral operators with Riesz-type kernels on s-dimensional Ahlfors-David regular subsets of Heisenberg groups. We show that $L^2$-boundedness, and even a little less, implies that $s$ must be an integer and…

Analysis of PDEs · Mathematics 2012-09-03 Vasilis Chousionis , Pertti Mattila

We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval $[\ell,s]$ of $[-1,1)$. An intricate relationship between Levenshtein-type upper bounds on…

Metric Geometry · Mathematics 2018-01-24 P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova

Dedekind domains and their class groups are notions in commutative algebra that are essential in algebraic number theory. We formalized these structures and several fundamental properties, including number theoretic finiteness results for…

Logic in Computer Science · Computer Science 2022-08-31 Anne Baanen , Sander R. Dahmen , Ashvni Narayanan , Filippo A. E. Nuccio

For an important class of arithmetic Dedekind domains O including the ring of integers of not totally complex number fields, we describe explicitly the group of linear characters of SL_2(O). For this, we determine, for arbitrary Dedekind…

Number Theory · Mathematics 2012-05-22 Hatice Boylan , Nils-Peter Skoruppa

We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…

Geometric Topology · Mathematics 2021-12-10 Sebastian Baader , Michael Lönne

This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for…

Information Theory · Computer Science 2010-10-08 Michael B. Baer

We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next…

Formal Languages and Automata Theory · Computer Science 2010-08-11 Galina Jirásková , Monika Krausová

We associate with every Renner monoid $R$ a \emph{generic Hecke algebra} $\H(R)$ over $\mathbb{Z}[q]$ which is a deformation of the monoid $\mathbb{Z}$-algebra of $R$. If $M$ is a finite reductive monoid with Borel subgroup $B$ and…

Group Theory · Mathematics 2010-02-08 Eddy Godelle

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

Motivated by a 1993 conjecture of Stanley and Stembridge, Shareshian and Wachs conjectured that the characteristic map takes the dot action of the symmetric group on the cohomology of a regular semisimple Hessenberg variety to $\omega…

Algebraic Geometry · Mathematics 2018-03-06 Patrick Brosnan , Timothy Y. Chow

This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one…

Logic in Computer Science · Computer Science 2023-06-22 Mai Gehrke , Daniela Petrisan , Luca Reggio

The notions of Betti numbers and of Bass numbers of a finite module N over a local ring R are extended to modules that are only assumed to be finite over S, for some local homomorphism f: R --> S. Various techniques are developed to study…

Commutative Algebra · Mathematics 2007-05-23 Luchezar L. Avramov , Srikanth Iyengar , Claudia Miller

A full subcategory of modules over a commutative ring $R$ is wide if it is abelian and closed under extensions. Hovey \cite{wide} gave a classification of wide subcategories of finitely presented modules over regular coherent rings in terms…

K-Theory and Homology · Mathematics 2009-12-03 Sunil K. Chebolu

First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to…

Logic in Computer Science · Computer Science 2017-06-27 Marco Voigt