Results 61 to 70 of about 67,579,596 (150)

Palindromic richness [PDF]

, 2008
In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense.
Zamboni, L, Luca Q. Zamboni, Zamboni, Luca Q., Justin, J., Widmer, S, Jacques Justin, Widmer, Steve, Widmer, Steven, Amy Glen, Glen, Amy, Justin, Jacques, Steve Widmer, Glen, A.   +12 more
core   +1 more source

Enumeration of Gelfand-Cetlin type reduced words

, 2022
The combinatorics of reduced words and their commutation classes plays an important role in geometric representation theory. For a semisimple complex Lie group G, a string polytope is a convex polytope associated with each reduced word of the longest ...
Kim, Jang Soo, Cho, Yunhyung, Eunjeong Lee   +2 more
core   +1 more source

Shuffle Product Formulas and Combinatorial Identities

Mathematics
We study shuffle product structures on words in three letters, extending the classical framework of multiple zeta values. Using an evaluation map that relates admissible words to iterated integrals, we translate shuffle identities into combinatorial ...
Kwang-Wu Chen
doaj   +1 more source

On the Limits of Intransitive Coordination

Ratio, EarlyView.
ABSTRACT A growing number of authors suggest that concept coordination—the kind of relation we pick out when we say that the concepts of one or more individuals represent something as the same—is not a transitive relation. Here we consider global features of representational systems to break new ground in the assessment of the intransitivity view. From
Víctor M. Verdejo, Joost J. Joosten
wiley   +1 more source

On the automorphisms of the power semigroups of a numerical semigroup

Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley   +1 more source

Occurrences of palindromes in characteristic Sturmian words [PDF]

, 2006
This paper is concerned with palindromes occurring in characteristic Sturmian words cα of slope α, where α∈(0,1) is an irrational. As cα is a uniformly recurrent infinite word, any (palindromic) factor of cα occurs infinitely many times in cα with ...
Glen, Amy, Glen, Amy Louise, Glen, A.
core   +1 more source

Linear Versus Centred Colouring via Pseudogrids

Journal of Graph Theory, Volume 113, Issue 3, Page 448-461, November 2026.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique.
Prosenjit Bose, Vida Dujmović, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin   +4 more
wiley   +1 more source

Combinatorics on partial word borders

Theoretical Computer Science, 2016
A partial word contains holes that can be filled with any character of the alphabet, a border is a non-empty proper prefix that is also a suffix, and the border array contains the length of the longest border of each prefix of the word. The authors determine the maximal number of holes with specified longest border, in particular in an unbordered ...
Emily Allen, Francine Blanchet-Sadri, Michelle Bodnar, Brian Bowers, Joe Hidakatsu, John Lensmire   +5 more
openaire   +3 more sources

Utterance evolution: the road to generative, combinatorial communicators

Biological Reviews, Volume 101, Issue 5, Page 2427-2447, October 2026.
ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford, Roman Martin Wittig, Cedric Girard‐Buttoz   +2 more
wiley   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source