Results 31 to 40 of about 69,062 (214)
Row-strict quasisymmetric Schur functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the $\textit{quasisymmetric Schur function basis}$ which are generated combinatorially through fillings of composition diagrams in much the same way as ...
Sarah K Mason, Jeffrey Remmel
doaj +1 more source
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
Minkowski decompositions of associahedra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Realisations of associahedra can be obtained from the classical permutahedron by removing some of its facets and the set of facets is determined by the diagonals of certain labeled convex planar $n$-gons as shown by Hohlweg and Lange (2007).
Carsten Lange
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Quantification and Determination of Compatible Bacterial Consortia [PDF]
Microb BiotechnolThis study presents a mathematical model to identify compatible bacterial consortia by analysing antagonistic and coexistence relationships. Introducing the Bacterial Coexistence Index (BCI), it evaluates bacterial viability. The model identified 36,851 strain sets promoting plant growth, optimising bacterial consortium design for sustainable ...
Pineda‐Pineda J +4 more
europepmc +2 more sources
Dynamics of the Picking transformation on integer partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper studies a conservative transformation defined on families of finite sets. It consists in removing one element from each set and adding a new set composed of the removed elements.
Thi Ha Duong Phan, Eric Thierry
doaj +1 more source
, 2004 This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works.
Aeppli +70 more
core +5 more sources
Number conserving cellular automata: new results on decidability and dynamics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
Bruno Durand +3 more
doaj +1 more source
Some exactly solvable models of urn process theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We establish a fundamental isomorphism between discrete-time balanced urn processes and certain ordinary differential systems, which are nonlinear, autonomous, and of a simple monomial form.
Philippe Flajolet +2 more
doaj +1 more source
Rainbow perfect matchings in r-partite graph structures [PDF]
, 2016 A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar +2 more
core +2 more sources