Results 61 to 70 of about 939,183 (156)
Star Unfolding Convex Polyhedra via Quasigeodesic Loops [PDF]
, 2008 We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (non-overlapping), planar polygon: cut along one shortest ...
A.D. Alexandrov +17 more
core +9 more sources
Partitions of an Integer into Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results.
Matthieu Latapy
doaj +1 more source
Counting occurrences for a finite set of words: an inclusion-exclusion approach [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In this paper, we give the multivariate generating function counting texts according to their length and to the number of occurrences of words from a finite set.
Frédérique Bassino +3 more
doaj +1 more source
Unfolding Orthogonal Terrains [PDF]
, 2007 It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece by cutting ...
O'Rourke, Joseph
core +2 more sources
Performance Evaluation of Demodulation Methods: a Combinatorial Approach [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 This paper provides a combinatorial approach for analyzing the performance of demodulation methods used in GSM. We also show how to obtain combinatorially a nice specialization of an important performance evaluation formula, using its connection with a ...
Daniel Krob, Ekaterina A. Vassilieva
doaj +1 more source
Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend +2 more
doaj +1 more source
Coherent random permutations with record statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 A two-parameter family of random permutations of $[n]$ is introduced, with distribution conditionally uniform given the counts of upper and lower records. The family interpolates between two versions of Ewens' distribution.
Alexander Gnedin
doaj +1 more source
Largest reduced neighborhood clique cover number revisited
, 2017 Let $G$ be a graph and $t\ge 0$. The largest reduced neighborhood clique cover number of $G$, denoted by ${\hat\beta}_t(G)$, is the largest, overall $t$-shallow minors $H$ of $G$, of the smallest number of cliques that can cover any closed neighborhood ...
Brown, André EX +11 more
core +3 more sources
Expected values of statistics on permutation tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Permutation tableaux are new objects that were introduced by Postnikov in the context of enumeration of the totally positive Grassmannian cells. They are known to be in bijection with permutations and recently, they have been connected to PASEP model ...
Sylvie Corteel, Pawel Hitczenko
doaj +1 more source
Distributional analysis of Robin Hood linear probing hashing with buckets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 This paper presents the first distributional analysis of a linear probing hashing scheme with buckets of size $b$. The exact distribution of the cost of successful searches for a $b \alpha$ -full table is obtained, and moments and asymptotic results are ...
Alfredo Viola
doaj +1 more source