Results 41 to 50 of about 2,688,347 (211)
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
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
Cost-sharing in Parking Games [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper, we study the total displacement statistic of parking functions from the perspective of cooperative game theory. We introduce parking games, which are coalitional cost-sharing games in characteristic function form derived from the total ...
Jennifer Elder +3 more
doaj +1 more source
Subcritical pattern languages for and/or trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Let $P_k(f)$ denote the density of and/or trees defining a boolean function $f$ within the set of and/or trees with fixed number of variables $k$. We prove that there exists constant $B_f$ such that $P_k(f) \sim B_f \cdot k^{-L(f)-1}$ when $k \to \infty$,
Jakub Kozik
doaj +1 more source
Tiling a Rectangle with Polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that the ...
Olivier Bodini
doaj +1 more source
Hypercontractivity on the symmetric group
Forum of Mathematics, SigmaThe hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more.
Yuval Filmus +3 more
doaj +1 more source
Multivariate generalizations of the Foata-Schützenberger equidistribution [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A result of Foata and Schützenberger states that two statistics on permutations, the number of inversions and the inverse major index, have the same distribution on a descent class.
Florent Hivert +2 more
doaj +1 more source
Four proofs of the directed Brooks' Theorem [PDF]
Discrete Mathematics, 2022, page 113193, 2021 We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.
arxiv
On the 2-adic order of Stirling numbers of the second kind and their differences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let $n$ and $k$ be positive integers, $d(k)$ and $\nu_2(k)$ denote the number of ones in the binary representation of $k$ and the highest power of two dividing $k$, respectively.
Tamás Lengyel
doaj +1 more source