Results 1 to 10 of about 333,180 (246)
Theoretical Computer Science and Discrete Mathematics [PDF]
, 2022 This book includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science ...
openaire +3 more sources
On the critical exponent of generalized Thue-Morse words [PDF]
, 2007 For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.Comment: 13 pages; to appear
Blondin-Massé, Alexandre +3 more
core +5 more sources
Flows on Simplicial Complexes [PDF]
, 2012 Given a graph $G$, the number of nowhere-zero $\ZZ_q$-flows $\phi_G(q)$ is known to be a polynomial in $q$. We extend the definition of nowhere-zero $\ZZ_q$-flows to simplicial complexes $\Delta$ of dimension greater than one, and prove the polynomiality
Beck, Matthias, Kemper, Yvonne
core +5 more sources
Counting descents, rises, and levels, with prescribed first element, in words [PDF]
, 2006 Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper were extended
Kitaev, Sergey +2 more
core +12 more sources
On the existence of block-transitive combinatorial designs [PDF]
, 2010 Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core +4 more sources
Teaching Discrete Mathematics to Computer Science Students [PDF]
, 2019 Discrete Mathematics is an inevitable part of any undergraduate computer science degree programme. However, computer science students typically find this to be at best a necessary evil with which they struggle to engage. Twenty years ago, we started to address this issue seriously in our university, and we have instituted a number of innovations ...
Faron Moller, Liam O’Reilly
openaire +2 more sources
Post-surjectivity and balancedness of cellular automata over groups [PDF]
, 2017 We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Capobianco, Silvio +2 more
core +1 more source
On the residual solvability of generalized free products of solvable groups
, 2011 In this paper, we study the residual solvability of the generalized free product of solvable groups.Comment: Discrete Mathematics & Theoretical Computer Science, Vol 13 ...
Kahrobaei, Delaram, Majewicz, Stephen
core +2 more sources
, 2017 Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability.
Morin, Pat +2 more
core +1 more source
$2\times 2$ monotone grid classes are finitely based
, 2016 In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations.
Albert, Michael, Brignall, Robert
core +1 more source