Dual point-partition number of complementary graphs
Dual properties within graph theory
Dualities in signed vector systems
Duality of antidiagonals and pipe dreams.
Duality triads of higher rank: Further properties and some examples
It is shown that duality triads of higher rank are closely related to orthogonal matrix polynomials on the real line. Furthermore, some examples of duality triads of higher rank are discussed. In particular, it is shown that the generalized Stirling numbers of rank r give rise to a duality triad of rank r.
Dualization of van Douwen diagram
Dualizing cubic graph theory
Důkaz Brouwerovy věty metodou teorie grafů
Duplicate inverse series relations and hypergeometric evaluations with
The Gould-Hsu (1973) inverse series relations have been systematically applied to the research of hypergeometric identities. Their duplicate version is established and used to demonstrate several terminating -summation formulas. Further hypergeometric evaluations with the same variable are obtained through recurrence relations.
Dürer polyhedra: the dark side of melancholia
Dürer's engraving Melencolia I famously includes a perspective view of a solid polyhedral block of which the visible portion is an 8-circuit bounding a pentagon-triple+triangle patch. The polyhedron is usually taken to be a cube truncated on antipodal corners, but an infinity of others are compatible with the visible patch. Construction of all cubic polyhedra compatible with the visible portion (i.e., Dürer Polyhedra) is discussed, explicit graphs and symmetries are listed for small cases ( ≤ 18...
Durfee polynomials.
Dyck paths with no peaks at height .
Dynamic cage survey.
Dynamic programming as optimal path problem in weighted digraphs.
Dynamic WWW structures in .
Dynamical characterization of C-sets and its application
We set up a general correspondence between algebraic properties of βℕ and sets defined by dynamical properties. In particular, we obtain a dynamical characterization of C-sets, i.e., sets satisfying the strong Central Sets Theorem. As an application, we show that Rado systems are solvable in C-sets.
Dynamical properties of the automorphism groups of the random poset and random distributive lattice
A method is developed for proving non-amenability of certain automorphism groups of countable structures and is used to show that the automorphism groups of the random poset and random distributive lattice are not amenable. The universal minimal flow of the automorphism group of the random distributive lattice is computed as a canonical space of linear orderings but it is also shown that the class of finite distributive lattices does not admit hereditary order expansions with the Amalgamation Property....
Dynamics of Stochastic Neuronal Networks and the Connections to Random Graph Theory
We analyze a stochastic neuronal network model which corresponds to an all-to-all network of discretized integrate-and-fire neurons where the synapses are failure-prone. This network exhibits different phases of behavior corresponding to synchrony and asynchrony, and we show that this is due to the limiting mean-field system possessing multiple attractors. We also show that this mean-field limit exhibits a first-order phase transition as a function...