Results 11 to 20 of about 332,141 (275)
DISCRETE MATHEMATICS AND COMPUTER SCIENCE: TEACHING METHODS
Humanities science current issuesSerhii OSMAN
openaire +2 more sources
Discrete mathematics at university level. Interfacing mathematics, computer science and arithmetic
, 2018 Discrete mathematics is a recent field linked with Computer Science. We discuss its place in university mathematics curricula and in the particular case of France, where it has difficulties to find its place. We make explicit the didactical challenges posed by discrete mathematics at university level, and present DEMIPS network and its plans to tackle ...
Ouvrier-Buffet, Cécile +2 more
openaire +3 more sources
Research on Curriculum Reform and Practice of Discrete Mathematics in Computer Science [PDF]
2023 2nd International Conference on Education, Humanities, Management and Information Technology (EHMIT 2023), 2023 Yuting Dai
openaire +2 more sources
On Teaching Discrete Mathematics to Freshman Computer Science Students [PDF]
Journal of Higher Education Theory and Practice, 2019 Faron Moller, Liam O'Reilly
openaire +4 more sources
Teaching Discrete Mathematics for Computer Science Majors [PDF]
2025 ASEE Midwest Section Conference ProceedingsPardaz Banu Mohammad, Arvin Agah
openaire +2 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
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
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