Results 31 to 40 of about 70,151 (171)
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
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
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
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
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
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