Results 51 to 60 of about 73,517 (203)
Permutations and associated algebras allow the construction of half and quarter BPS operators in maximally supersymmetric Yang Mills theory with U(N), SO(N) and Sp(N) gauge groups.
Christopher Lewis-Brown +1 more
doaj +1 more source
Finite-Repetition threshold for infinite ternary words [PDF]
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a ...
Golnaz Badkobeh, Maxime Crochemore
doaj +1 more source
Canonical Representatives of Morphic Permutations [PDF]
An infinite permutation can be defined as a linear ordering of the set of natural numbers. In particular, an infinite permutation can be constructed with an aperiodic infinite word over $\{0,\ldots,q-1\}$ as the lexicographic order of the shifts of the ...
A Frid +17 more
core +4 more sources
Some combinatorics of rhomboid-shaped fully packed loop configurations [PDF]
The study of rhomboid-shaped fully packed loop configurations (RFPLs) is inspired by the work of Fischer and Nadeau on triangular fully packed loop configurations (TFPLs).
Sabine Beil
doaj +1 more source
Ten Conferences WORDS: Open Problems and Conjectures
In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS.
Néraud, Jean
core +3 more sources
The Identity Correspondence Problem and its Applications [PDF]
In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an identity pair by a ...
C. Choffrut +13 more
core +4 more sources
This study provides an introduction to Bayesian optimisation targeted for experimentalists. It explains core concepts, surrogate modelling, and acquisition strategies, and addresses common real‐world challenges such as noise, constraints, mixed variables, scalability, and automation.
Chuan He +2 more
wiley +1 more source
Two strings at Hamming distance 1 cannot be both quasiperiodic
We present a generalization of a known fact from combinatorics on words related to periodicity into quasiperiodicity. A string is called periodic if it has a period which is at most half of its length. A string $w$ is called quasiperiodic if it has a non-
Amir, Amihood +2 more
core +1 more source
ABSTRACT Little is known about consumer preferences for combinations of circular business model patterns, despite their potential to benefit the design of product services. This study examines consumer preferences for product‐as‐a‐service offers, combined with circular product attributes, across Sweden and the Netherlands.
Steven Sarasini +5 more
wiley +1 more source
Random multilinear maps and the Erdős box problem
Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 more
doaj +1 more source

