Results 1 to 10 of about 698 (72)
Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the following problem: Given $k$ paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is monotone in some direction?
David Bremner +8 more
doaj +1 more source
Matching solid shapes in arbitrary dimension via random sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give simple probabilistic algorithms that approximately maximize the volume of overlap of two solid, i.e. full-dimensional, shapes under translations and rigid motions. The shapes are subsets of $ℝ^d$ where $d≥ 2$.
Daria Schymura
doaj +1 more source
New Bounds for Hypercube Slicing Numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of ...
M. Reza Emamy-Khansary, Martin Ziegler
doaj +1 more source
Tilings of a Domain on a Hexagon Mesh with Balanced 3-Tiles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this article, we study the question of tilings on a hexagon mesh with balanced 3-tiles. This problem has been studied by Conway and Lagarias in [CL90], by studying the tiling groups, in fact a group containing the tiling-groups, and their Cayley ...
Gilles Radenne
doaj +1 more source
The Many Faces of Alternating-Sign Matrices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 I give a survey of different combinatorial forms of alternating-sign matrices, starting with the original form introduced by Mills, Robbins and Rumsey as well as corner-sum matrices, height-function matrices, three-colorings, monotone triangles ...
James Propp
doaj +1 more source
An n-Dimensional Generalization of the Rhombus Tiling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Several classic tilings, including rhombuses and dominoes, possess height functions which allow us to 1) prove ergodicity and polynomial mixing times for Markov chains based on local moves, 2) use coupling from the past to sample perfectly random tilings,
Joakim Linde +2 more
doaj +1 more source
On the Toppling of a Sand Pile [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we provide the first study of the sand pile model SPM(0) where we assume that all the grains are numbered with a distinct integer.We obtain a lower bound on the number of terminal sand piles by establishing a bijection between a subset of ...
Jean-Christophe Novelli +1 more
doaj +1 more source
Tiling the Line with Triples [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 It is known the one dimensional prototile $0,a,a+b$ and its reflection $0,b,a+b$ always tile some interval. The subject has not received a great deal of further attention, although many interesting questions exist.
Aaron Meyerowitz
doaj +1 more source
Enumerating Triangulations of Convex Polytopes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A triangulation of a finite point set A in $\mathbb{R}^d$ is a geometric simplicial complex which covers the convex hull of $A$ and whose vertices are points of $A$.
Sergei Bespamyatnikh
doaj +1 more source
Characterization of Lattices Induced by (extended) Chip Firing Games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 The Chip Firing Game (CFG) is a discrete dynamical model used in physics, computer science and economics. It is known that the set of configurationsreachable from an initial configuration (this set is called the \textitconfiguration space) can be ordered
Clémence Magnien +2 more
doaj +1 more source