English
Related papers

Related papers: The Parikh functions of sparse context-free langua…

200 papers

We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…

Number Theory · Mathematics 2015-06-02 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include…

Formal Languages and Automata Theory · Computer Science 2024-04-17 Matt Earnshaw , Mario Román

Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in…

Combinatorics · Mathematics 2018-08-14 Adrian Atanasiu , Ghajendran Poovanandran , Wen Chean Teh

I would like to tell a story. A story about a beautiful mathematical relationship that elucidates the computational view on the classic subject of trigonometry. All stories need a language, and for this particular story an algorithmic…

Data Structures and Algorithms · Computer Science 2022-07-05 Peter Kourzanov

We consider the cyclic closure of a language, and its generalisation to the operators $C^k$ introduced by Brandst\"adt. We prove that the cyclic closure of an indexed language is indexed, and that if $L$ is a context-free language then…

Formal Languages and Automata Theory · Computer Science 2015-01-06 Tara Brough , Laura Ciobanu , Murray Elder

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

Functional Analysis · Mathematics 2010-11-23 Miguel Couceiro , Jean-Luc Marichal

We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh automata on infinite words. We consider the deterministic as…

Formal Languages and Automata Theory · Computer Science 2025-11-12 Mario Grobler , Leif Sabellek , Sebastian Siebertz

The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…

Combinatorics · Mathematics 2018-12-05 Andrew V. Sills , Doron Zeilberger

The hairpin completion is an operation on formal languages that has been inspired by the hairpin formation in DNA biochemistry and by DNA computing. In this paper we investigate the hairpin completion of regular languages. It is well known…

Formal Languages and Automata Theory · Computer Science 2011-08-12 Volker Diekert , Steffen Kopecki , Victor Mitrana

We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…

Functional Analysis · Mathematics 2022-06-09 Olavi Nevanlinna

In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. The two main results of the paper are the following. First, we…

Formal Languages and Automata Theory · Computer Science 2011-02-07 Jean Berstel , Luc Boasson , Isabelle Fagnot

This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties…

Programming Languages · Computer Science 2023-06-22 Andrei Stefanescu , Stefan Ciobaca , Radu Mereuta , Brandon Moore , Traian Florin Serbanuta , Grigore Rosu

We give examples of smooth $\k$-unirational line-free quartic hypersurfaces over a non algebraically closed field $\k$. Unlike other methods of proving unirationality, our method does not rely on existence of linear spaces on quartics.

Algebraic Geometry · Mathematics 2007-08-21 Nikolay Zak

We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products $\Gamma\wr\SG_n$ and…

Combinatorics · Mathematics 2007-05-23 Jean-Christophe Novelli , Jean-Yves Thibon

We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…

Combinatorics · Mathematics 2014-07-01 Francesco Brenti , Fabrizio Caselli

In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…

Logic in Computer Science · Computer Science 2013-04-02 Matthew S. Bauer

A paper by Boros, Little, Moll, Mosteig, and Stanley relates properties of a map defined on the space of rational functions to Eulerian polynomials. We link their work to the carries Markov chain, giving a new proof and slight…

Combinatorics · Mathematics 2023-06-12 Jason Fulman

Nash and Tognoli show that smooth closed manifolds can be the zero sets of some real polynomial maps and non-singular. The canonical projections of spheres naturally embedded in the $1$-dimensional higher Euclidean spaces and some natural…

Algebraic Geometry · Mathematics 2024-04-09 Naoki Kitazawa

In this paper we obtain several new complete characterizations of pseudolinear functions. Two of the results are of first-order and one is derivative free. All results are derived in terms of the Clarke-Rockafellar subdifferential.…

Optimization and Control · Mathematics 2025-11-25 Vsevolod I. Ivanov

We generalize both the notion of polynomial functions on Lie groups and the notion of horizontally affine maps on Carnot groups. We fix a subset $S$ of the algebra $\mathfrak g$ of left-invariant vector fields on a Lie group $\mathbb G$ and…

Group Theory · Mathematics 2020-11-30 Gioacchino Antonelli , Enrico Le Donne
‹ Prev 1 3 4 5 6 7 10 Next ›