Results 61 to 70 of about 698 (72)
The difficulty of folding self-folding origami
, 2017 Why is it difficult to refold a previously folded sheet of paper? We show that even crease patterns with only one designed folding motion inevitably contain an exponential number of `distractor' folding branches accessible from a bifurcation at the flat ...
Murugan, Arvind +2 more
core +2 more sources
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
Configuration Spaces Of Convex And Embedded Polygons In The Plane [PDF]
, 2014 This paper concerns the topology of configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line.
Shimamoto, Don H. +1 more
core +1 more source
Rooted trees and moments of large sparse random matrices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach.
Oleksiy Khorunzhiy
doaj +1 more source
No dimension independent Core-Sets for Containment under Homothetics
, 2012 This paper deals with the containment problem under homothetics which has the minimal enclosing ball (MEB) problem as a prominent representative. We connect the problem to results in classic convex geometry and introduce a new series of radii, which we ...
Brandenberg, Rene, Koenig, Stefan
core +1 more source
The distribution of ascents of size $d$ or more in samples of geometric random variables [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider words or strings of characters $a_1a_2a_3 \ldots a_n$ of length $n$, where the letters $a_i \in \mathbb{Z}$ are independently generated with a geometric probability $\mathbb{P} \{ X=k \} = pq^{k-1}$ where $p+q=1$.
Charlotte Brennan, Arnold Knopfmacher
doaj +1 more source
Partitioning Regular Polygons into Circular Pieces I: Convex Partitions [PDF]
, 2003 We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1.
Damian, Mirela, O'Rourke, Joseph
core +2 more sources
Classification of large Pólya-Eggenberger urns with regard to their asymptotics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 This article deals with Pólya generalized urn models with constant balance in any dimension. It is based on the algebraic approach of Pouyanne (2005) and classifies urns having "large'' eigenvalues in five classes, depending on their almost sure ...
Nicolas Pouyanne
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
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