English
Related papers

Related papers: Kunz languages for numerical semigroups are contex…

200 papers

We construct the fusion ring of a quasi-rational $\hat{sl}(4)_k$ WZNW theory at generic level $k \not\in Q$. It is generated by commutative elements in the group ring $Z[\tilde{W}]$ of the affine Weyl group $\tilde{W}$ which extend…

High Energy Physics - Theory · Physics 2009-11-07 P. Furlan , V. B. Petkova

We introduce the quasi-ordinarization transform of a numerical semigroup. This transform will allow to organize all the semigroups of a given genus in a forest rooted at all quasi-ordinary semigroups with the given genus. This construction…

Combinatorics · Mathematics 2021-06-16 Maria Bras-Amorós , Hebert Pérez-Rosés , José Miguel Serradilla-Merinero

In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succinctly represented by a grammar generating it, or an automaton…

Formal Languages and Automata Theory · Computer Science 2024-10-11 Szilárd Zsolt Fazekas , Tore Koß , Florin Manea , Robert Mercaş , Timo Specht

A semigroupoid is a set equipped with a partially defined associative operation. Given a semigroupoid \Lambda we construct a C*-algebra C*(\Lambda) from it. We then present two main examples of semigroupoids, namely the Markov semigroupoid…

Operator Algebras · Mathematics 2007-05-23 Ruy Exel

State-of-the-art natural language processing (NLP) models are trained on massive training corpora, and report a superlative performance on evaluation datasets. This survey delves into an important attribute of these datasets: the dialect of…

Computation and Language · Computer Science 2024-12-10 Aditya Joshi , Raj Dabre , Diptesh Kanojia , Zhuang Li , Haolan Zhan , Gholamreza Haffari , Doris Dippold

Pretrained language models have achieved a new state of the art on many NLP tasks, but there are still many open questions about how and why they work so well. We investigate the contextualization of words in BERT. We quantify the amount of…

Computation and Language · Computer Science 2020-10-13 Mengjie Zhao , Philipp Dufter , Yadollah Yaghoobzadeh , Hinrich Schütze

In recent years, new algorithms and cryptographic protocols based on the laws of quantum physics have been designed to outperform classical communication and computation. We show that the quantum world also opens up new perspectives in the…

Quantum Physics · Physics 2010-07-06 S. Perseguers , M. Lewenstein , A. Acín , J. I. Cirac

The pre-training of text encoders normally processes text as a sequence of tokens corresponding to small text units, such as word pieces in English and characters in Chinese. It omits information carried by larger text granularity, and thus…

Computation and Language · Computer Science 2019-11-05 Shizhe Diao , Jiaxin Bai , Yan Song , Tong Zhang , Yonggang Wang

In this paper we explore a new hierarchy of classes of languages and infinite words and its connection with complexity classes. Namely, we say that a language belongs to the class $L_k$ if it is a subset of the catenation of $k$ languages…

Formal Languages and Automata Theory · Computer Science 2014-06-17 J. Cassaigne , A. E. Frid , S. Puzynina , L. Q. Zamboni

Let $S=\langle a_1,\ldots,a_p\rangle$ be a numerical semigroup, $s\in S$ and ${\sf z}(s)$ its set of factorizations. The set of length is denoted by ${\mathcal L}(s)=\{{\tt L}(x_1,\dots,x_p)\mid (x_1,\dots,x_p)\in{\sf Z}(s)\}$ where ${\tt…

Commutative Algebra · Mathematics 2019-06-05 J. I. García-García , D. Marín-Aragón , A. Vigneron-Tenorio

A language L is prefix-free if, whenever words u and v are in L and u is a prefix of v, then u=v. Suffix-, factor-, and subword-free languages are defined similarly, where "subword" means "subsequence". A language is bifix-free if it is…

Formal Languages and Automata Theory · Computer Science 2011-05-13 Janusz Brzozowski , Galina Jirásková , Baiyu Li , Joshua Smith

Language is a social phenomenon and variation is inherent to its social nature. Recently, there has been a surge of interest within the computational linguistics (CL) community in the social dimension of language. In this article we present…

Computation and Language · Computer Science 2016-04-07 Dong Nguyen , A. Seza Doğruöz , Carolyn P. Rosé , Franciska de Jong

Regular nested word languages (a.k.a. visibly pushdown languages) strictly extend regular word languages, while preserving their main closure and decidability properties. Previous works have shown that considering languages of 2-nested…

Formal Languages and Automata Theory · Computer Science 2022-08-23 Séverine Fratani , Guillaume Maurras , Pierre-Alain Reynier

A numerical semigroup $S$ is a subset of the non-negative integers containing $0$ that is closed under addition. The Hilbert series of $S$ (a formal power series equal to the sum of terms $t^n$ over all $n \in S$) can be expressed as a…

Commutative Algebra · Mathematics 2019-03-26 Jeske Glenn , Christopher O'Neill , Vadim Ponomarenko , Benjamin Sepanski

Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical…

Combinatorics · Mathematics 2023-02-17 Hannah E. Burson , Hayan Nam , Simone Sisneros-Thiry

A classification result is obtained for the C*-algebras that are (stably isomorphic to) inductive limits of 1-dimensional noncommutative CW complexes with trivial $K_1$-group. The classifying functor Cu is defined in terms of the Cuntz…

Operator Algebras · Mathematics 2012-08-28 Leonel Robert

A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…

Combinatorics · Mathematics 2020-08-20 Deepesh Singhal

For special universal $C^*$-algebras associated to $k$-semigraphs we present the universal representations of these algebras, prove a Cuntz--Krieger uniqueness theorem, and compute the $K$-theory. These $C^*$-algebras seem to be the most…

Operator Algebras · Mathematics 2013-06-24 Bernhard Burgstaller

In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…

Number Theory · Mathematics 2016-09-27 Simone Ugolini

We work with rational rank 1 valuations centered in regular local rings. Given an algebraic function field $K$ of transcendence degree 3 over $k$, a regular local ring $R$ with $QF(R)=K$ and a $k$-valuation $\nu$ of $K$, we provide an…

Commutative Algebra · Mathematics 2015-07-17 Olga Kashcheyeva