Results 31 to 40 of about 1,399 (173)
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
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
A Novel Approach to Topological Indices of the Identity Graph Associated with the Finite Group
Jurnal DiferensialGraph theory is applied to study network structures in various disciplines, such as computer science and discrete mathematics. The combination of graphs and algebra has become a widely discussed topic in research within the fields of algebra and ...
Abdul Gazir Syarifudin +4 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
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability [PDF]
TheoretiCSWe show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation.
David E. Roberson, Tim Seppelt
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
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
Utterance evolution: the road to generative, combinatorial communicators
Biological Reviews, EarlyView.ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford +2 more
wiley +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