Results 51 to 60 of about 1,399 (173)
Quasirandomness in discrete mathematics, additive combinatorics and group theory
, 2020 The main objective of this bachelor's thesis will be to present the concept of quasirandomness in various mathematical contexts while proving all the pertinent results. We will introduce the results of Fan Chung and Ronald Graham on quasirandom graphs and quasirandom sets, and the results of Timothy Gowers on quasirandom groups.
openaire +2 more sources
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
Experimental Physiology, EarlyView.Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley +1 more source
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of $\textit{Self-Organized Criticality}$. From a configuration composed of a finite number of stacked grains, we apply on every possible positions (in parallel) two grain moving ...
Kévin Perrot +2 more
doaj +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, Volume 34, Issue 9, Page 437-456, September 2026.ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Around the root of random multidimensional quadtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle +2 more
doaj +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source
Efficient estimation of the cardinality of large data sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Giroire has recently proposed an algorithm which returns the $\textit{approximate}$ number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases.
Philippe Chassaing, Lucas Gerin
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
, 2007 The Probabilistic Method was primarily used in Combinatorics and pioneered by Erdös Pai, better known to Westerners as Paul Erdos in the 1950s. The probabilistic method is a powerful tool for solving many problems in discrete mathematics, combinatorics ...
Asafu-Adjei, Joseph Kwaku
core +2 more sources
Roger Labahn: Handwritten Text Recognition. Key concepts
, 2016 Roger Labahn (University of Rostock, DE) Roger Labahn received his doctoral degree in 1987 and finished his habilitation in 1994, both in Discrete Mathematics / Combinatorics.
Elisabeth Steiger
core +1 more source