Results 21 to 30 of about 893,053 (74)
On the density and the structure of the Peirce-like formulae [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Within the language of propositional formulae built on implication and a finite number of variables $k$, we analyze the set of formulae which are classical tautologies but not intuitionistic (we call such formulae - Peirce's formulae).
Antoine Genitrini +2 more
doaj +1 more source
On the number of zero increments of random walks with a barrier [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Continuing the line of research initiated in Iksanov and Möhle (2008) and Negadajlov (2008) we investigate the asymptotic (as $n \to \infty$) behaviour of $V_n$ the number of zero increments before the absorption in a random walk with the barrier $n$. In
Alex Iksanov, Pavlo Negadajlov
doaj +1 more source
Volume Laws for Boxed Plane Partitions and Area Laws for Ferrers Diagrams [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We asymptotically analyse the volume random variables of general, symmetric and cyclically symmetric plane partitions fitting inside a box. We consider the respective symmetry class equipped with the uniform distribution.
Uwe Schwerdtfeger
doaj +1 more source
Product decomposition for surjective 2-block NCCA [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 In this paper we define products of one-dimensional Number Conserving Cellular Automata (NCCA) and show that surjective NCCA with 2 blocks (i.e radius 1/2) can always be represented as products of shifts and identites.
Felipe García-Ramos
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
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of $\textit{Self-Organized Criticality}$. From a configuration composed of a finite number of stacked grains, we apply on every possible positions (in parallel) two grain moving ...
Kévin Perrot +2 more
doaj +1 more source
Error bounds in stochastic-geometric normal approximation [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We provide normal approximation error bounds for sums of the form $\sum_x \xi_x$, indexed by the points $x$ of a Poisson process (not necessarily homogeneous) in the unit $d$-cube, with each term $\xi_x$ determined by the configuration of Poisson points ...
Mathew Penrose, Tom Rosoman
doaj +1 more source
Point process stabilization methods and dimension estimation [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We provide an overview of stabilization methods for point processes and apply these methods to deduce a central limit theorem for statistical estimators of dimension.
J. E. Yukich
doaj +1 more source
Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted.
Lorenz A. Gilch
doaj +1 more source
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source