Results 61 to 70 of about 2,700,684 (210)
Toward a Solution of Archdeacon's Conjecture on Integer Heffter Arrays
Journal of Combinatorial Designs, Volume 33, Issue 8, Page 310-323, August 2025.ABSTRACT In this article, we make significant progress on a conjecture proposed by Dan Archdeacon on the existence of integer Heffter arrays H ( m , n ; s , k ) whenever the necessary conditions hold, that is, 3 ⩽ s ⩽ n, 3 ⩽ k ⩽ m, m s = n k and n k ≡ 0 , 3 ( mod 4 ).
Marco Antonio Pellegrini +1 more
wiley +1 more source
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in [BR99] as a formal model for analyzing simulation systems.
Christopher L. Barrett +5 more
doaj +1 more source
Journal of Combinatorial Designs, Volume 33, Issue 8, Page 300-309, August 2025.ABSTRACT We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that burning spreads to neighboring vertices over time via a specified propagation rule.
Anthony Bonato +3 more
wiley +1 more source
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
The Directed Oberwolfach Problem With Variable Cycle Lengths: A Recursive Construction
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 239-260, July 2025.ABSTRACT The directed Oberwolfach problem OP * ( m 1 , … , m k ) asks whether the complete symmetric digraph K n *, assuming n = m 1 + ⋯ + m k, admits a decomposition into spanning subdigraphs, each a disjoint union of k directed cycles of lengths m 1 , … , m k.
Suzan Kadri, Mateja Šajna
wiley +1 more source
Formalizing the transformations of a cognitive universe [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In an effort to continue the pioneering work of Harary in USA and Flament in France, we have undertaken to develop, on an experimental basis, a formalized theory of systems of beliefs and their modifications.
N. Lafaye de Micheaux +3 more
doaj +1 more source
Chang's lemma via Pinsker's inequality [PDF]
Discrete Mathematics 343.1 (2020): 111496, 2020 Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a short information theoretic proof for Chang's lemma that is based on Pinsker's inequality.
arxiv
, 2018 The article is devoted to the actual issues of teaching discrete mathematics in the institutions of higher technical education (IHTE). For future IT professionals, knowledge in mathematical logic is of great i m-portance in future professional activities,
Z. Bondarenko +2 more
semanticscholar +1 more source
On the Terwilliger Algebra of the Group Association Scheme of the Symmetric Group Sym ( 7 )
Journal of Combinatorial Designs, Volume 33, Issue 7, Page 261-274, July 2025.ABSTRACT Terwilliger algebras are finite‐dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance‐regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups Sym ( n ), for 3 ≤ n ≤ 6, have been studied and completely determined ...
Allen Herman +2 more
wiley +1 more source
Enumeration and Random Generation of Concurrent Computations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 In this paper, we study the shuffle operator on concurrent processes (represented as trees) using analytic combinatorics tools. As a first result, we show that the mean width of shuffle trees is exponentially smaller than the worst case upper-bound.
Olivier Bodini +2 more
doaj +1 more source