Results 41 to 50 of about 698 (72)
Quantum random walks in one dimension via generating functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip matrices. Using a multivariate generating function analysis we give a simplified proof of a known phenomenon, namely that the walk has linear speed rather ...
Andrew Bressler, Robin Pemantle
doaj +1 more source
Intrinsic universality and the computational power of self-assembly
, 2013 This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models.
Woods, Damien
core +2 more sources
Algorithmic Computation of Polynomial Amoebas [PDF]
, 2016 We present algorithms for computation and visualization of polynomial amoebas, their contours, compactified amoebas and sec- tions of three-dimensional amoebas by two-dimensional planes.
Богданов, Д. В. +2 more
core +1 more source
A new method for computing asymptotics of diagonal coefficients of multivariate generating functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Let $\sum_{\mathbf{n} \in \mathbb{N}^d} F_{\mathbf{n}} \mathbf{x}^{\mathbf{n}}$ be a multivariate generating function that converges in a neighborhood of the origin of $\mathbb{C}^d$. We present a new, multivariate method for computing the asymptotics of
Alexander Raichev, Mark C. Wilson
doaj +1 more source
Approximating Persistent Homology in Euclidean Space Through Collapses [PDF]
, 2014 The \v{C}ech complex is one of the most widely used tools in applied algebraic topology. Unfortunately, due to the inclusive nature of the \v{C}ech filtration, the number of simplices grows exponentially in the number of input points.
Botnan, Magnus Bakke, Spreemann, Gard
core +1 more source
The average position of the first maximum in a sample of geometric random variables [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 We consider samples of n geometric random variables $(Γ _1, Γ _2, \dots Γ _n)$ where $\mathbb{P}\{Γ _j=i\}=pq^{i-1}$, for $1≤j ≤n$, with $p+q=1$. The parameter we study is the position of the first occurrence of the maximum value in a such a sample.
Margaret Archibald, Arnold Knopfmacher
doaj +1 more source
Enumerating Foldings and Unfoldings between Polygons and Polytopes [PDF]
, 2001 We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons.
Demaine, Erik D. +3 more
core +2 more sources
The persistence landscape and some of its properties
, 2019 Persistence landscapes map persistence diagrams into a function space, which may often be taken to be a Banach space or even a Hilbert space. In the latter case, it is a feature map and there is an associated kernel. The main advantage of this summary is
A Adcock +33 more
core +1 more source
, 2014 We construct a discrete form of Hamilton's Ricci flow (RF) equations for a d-dimensional piecewise flat simplicial geometry, S. These new algebraic equations are derived using the discrete formulation of Einstein's theory of general relativity known as ...
David Gu +6 more
core +1 more source
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source