Results 61 to 70 of about 2,178 (219)
Combinatorics on partial word correlations
Journal of Combinatorial Theory, Series A, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francine Blanchet-Sadri +3 more
openaire +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, EarlyView.ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
String attractors of fixed points of k-bonacci-like morphisms [PDF]
, 2023 peer reviewedFirstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words.
Stipulanti M. +5 more
core +1 more source
On an Algorithm for Multiperiodic Words
Acta Polytechnica, 2013 We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet.
Štepán Holub
doaj
Forbidden intersection problems for families of linear maps
Discrete Analysis, 2023 Forbidden intersection problems for families of linear maps, Discrete Analysis 2023:19, 32 pp. A central problem in extremal combinatorics is to determine the maximal size of a set system given constraints on the sizes of the sets in the system and on ...
David Ellis, Guy Kindler, Noam Lifshitz
doaj +1 more source
Creativity and Innovation Management, EarlyView.ABSTRACT This paper explores the limits of mission‐directed entrepreneurial states by drawing on the theory of recombinant innovation and F.A. Hayek's insights on the spontaneous growth of knowledge in society. First, the use of discretionary policymaking curtails the range of knowledge generated in the process of social interaction, limiting the scope
Bryan Cheang, Praharsh Mehrotra
wiley +1 more source
Shuffle Product Formulas and Combinatorial Identities
MathematicsWe 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
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
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 +5 more
openaire +2 more sources
The Role of Dice in the Emergence of the Probability Calculus
International Statistical Review, EarlyView.Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source