Results 41 to 50 of about 69,062 (214)
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
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
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
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
Some remarks on multiplicity codes
, 2014 Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core +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
Constrained exchangeable partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Alexander Gnedin
doaj +1 more source
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj +1 more source
Analysis of an algorithm catching elephants on the Internet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper),
Yousra Chabchoub +3 more
doaj +1 more source