English
Related papers

Related papers: Kunz languages for numerical semigroups are contex…

200 papers

We give an affirmative answer to Wilf's conjecture for numerical semigroups satisfying 2 \nu \geq m, where \nu and m are respectively the embedding dimension and the multiplicity of a semigroup. The conjecture is also proved when m \leq 8…

Commutative Algebra · Mathematics 2012-12-18 Alessio Sammartano

We investigate the interplay of the following regularity properties for non-simple C*-algebras: finite nuclear dimension, Z-stability, and algebraic regularity in the Cuntz semigroup. We show that finite nuclear dimension implies algebraic…

Operator Algebras · Mathematics 2017-04-12 Leonel Robert , Aaron Tikuisis

For any numerical semigroup $S$, there are infinitely many numerical symmetric semigroups $T$ such that $S=\frac{T}{2}$ is their half. We are studying the Betti numbers of the numerical semigroup ring $K[T]$ when $S$ is a 3-generated…

Commutative Algebra · Mathematics 2011-11-08 Vincenzo Micale , Anda Olteanu

We present procedures to calculate the set of Arf numerical semigroups with given genus, given conductor and given genus and conductor. We characterize the Kunz coordinates of an Arf numerical semigroup. We also describe Arf numerical…

Commutative Algebra · Mathematics 2016-08-08 P. A. García-Sánchez , B. A. Heredia , H. İ. Karakaş , J. C. Rosales

We examine the ranks of operators in semi-finite C*-algebras as measured by their densely defined lower semicontinuous traces. We first prove that a unital simple C*-algebra whose extreme tracial boundary is nonempty and finite contains…

Operator Algebras · Mathematics 2015-06-01 Aaron Tikuisis , Andrew Toms

In [5] the author conjectures and partially shows that the Cuntz semigroup classifies unitary elements of unital AF-algebras. We provide a complete proof by addressing the existence part of the conjecture, under a mild adjustment of both…

Operator Algebras · Mathematics 2025-03-04 Laurent Cantier

This paper provides a geometric characterization of subclasses of the regular languages. We use finite model theory to characterize objects like strings and trees as relational structures. Logical statements meeting certain criteria over…

Formal Languages and Automata Theory · Computer Science 2019-08-23 Jonathan Rawski

Language is contextual as meanings of words are dependent on their contexts. Contextuality is, concomitantly, a well-defined concept in quantum mechanics where it is considered a major resource for quantum computations. We investigate…

Computation and Language · Computer Science 2021-08-02 Daphne Wang , Mehrnoosh Sadrzadeh , Samson Abramsky , Victor H. Cervantes

An affine semigroup is a finitely generated subsemigroup of $(\mathbb Z_{\ge 0}^d, +)$, and a numerical semigroup is an affine semigroup with $d = 1$. A growing body of recent work examines shifted families of numerical semigroups, that is,…

Combinatorics · Mathematics 2021-11-03 Christopher O'Neill , Isabel White

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge L. Ramírez Alfonsín , Oystein J. Rodseth

The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…

A digraph D=(V,A) is mediated if, for each pair x,y of distinct vertices of D, either xy belongs to A or yx belongs to A or there is a vertex z such that both xz,yz belong to A. For a digraph D, DELTA(D) is the maximum in-degree of a vertex…

Combinatorics · Mathematics 2007-05-23 Gregory Gutin , Nick S. Jones , Arash Rafiey , Simone Severini , Anders Yeo

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, and $T_n(\mathbb{K})$ be the set of $n\times n$ lower triangular matrices with entries in $\mathbb{K}$. We show that $T_n(\mathbb{K})$ has dense subsemigroups that are generated by $n+1$…

Dynamical Systems · Mathematics 2017-07-21 Mohammad Javaheri

A natural operation on numerical semigroups is taking a quotient by a positive integer. If $\mathcal S$ is a quotient of a numerical semigroup with $k$ generators, we call $\mathcal S$ a $k$-quotient. We give a necessary condition for a…

Commutative Algebra · Mathematics 2022-12-20 Tristram Bogart , Christopher O'Neill , Kevin Woods

We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2C(n+1)-2C(n)+1.

Combinatorics · Mathematics 2013-02-12 L. Balkova , E. Pelantova

Prior work has shown the existence of contextual neurons in language models, including a neuron that activates on German text. We show that this neuron exists within a broader contextual n-gram circuit: we find late layer neurons which…

Machine Learning · Computer Science 2023-11-03 Lucia Quirke , Lovis Heindrich , Wes Gurnee , Neel Nanda

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

Rings and Algebras · Mathematics 2019-09-24 Miguel Couceiro , Jimmy Devillet

We discuss some types of congruences on Menger algebras of rank $n$, which are generalizations of the principal left and right congruences on semigroups. We also study congruences admitting various types of cancellations and describe their…

Rings and Algebras · Mathematics 2015-01-27 Wieslaw A. Dudek , Valentin S. Trokhimenko

We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…

Formal Languages and Automata Theory · Computer Science 2025-07-02 Jorge Almeida , Ondřej Klíma

A quasigroup is a pair $(Q, *)$ where $Q$ is a non-empty set and $*$ is a binary operation on $Q$ such that for every $(a, b) \in Q^2$ there exists a unique $(x, y) \in Q^2$ such that $a*x=b=y*a$. Let $(Q, *)$ be a quasigroup. A pair $(x,…

Combinatorics · Mathematics 2024-12-12 Jack Allsop , Ian M. Wanless
‹ Prev 1 4 5 6 7 8 10 Next ›