Results 71 to 80 of about 70,151 (171)
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in [BR99] as a formal model for analyzing simulation systems.
Christopher L. Barrett +5 more
doaj +1 more source
, 2013 I state some open problems coming from joint work with Paul Erd\H{o}sComment: This is a paper form of the talk I gave on July 5, 2013 at the centennial conference in Budapest to honor Paul Erd\H{o}
Gyárfás, András
core
Two‐Round Ramsey Games on Random Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Motivated by the investigation of sharpness of thresholds for Ramsey properties in random graphs, Friedgut, Kohayakawa, Rödl, Ruciński and Tetali introduced two variants of a single‐player game whose goal is to colour the edges of a random graph, in an online fashion, so as not to create a monochromatic triangle.
Yahav Alon +2 more
wiley +1 more source
Formalizing the transformations of a cognitive universe [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In an effort to continue the pioneering work of Harary in USA and Flament in France, we have undertaken to develop, on an experimental basis, a formalized theory of systems of beliefs and their modifications.
N. Lafaye de Micheaux +3 more
doaj +1 more source
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
Which singular tangent bundles are isomorphic?
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract Logarithmic and b$ b$‐tangent bundles provide a versatile framework for addressing singularities in geometry. Introduced by Deligne and Melrose, these modified bundles resolve singularities by reframing singular vector fields as well‐behaved sections of these singular bundles.
Eva Miranda, Pablo Nicolás
wiley +1 more source
Enumeration and Random Generation of Concurrent Computations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 In this paper, we study the shuffle operator on concurrent processes (represented as trees) using analytic combinatorics tools. As a first result, we show that the mean width of shuffle trees is exponentially smaller than the worst case upper-bound.
Olivier Bodini +2 more
doaj +1 more source
Polytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cycles
, 2019 The problem of deciding if a given triangulation of a sphere can be realized as the boundary sphere of a simplicial, convex polytope is known as the "Simplicial Steinitz problem".
Jevtić, Filip D. +2 more
core +1 more source
Exactness and the topology of the space of invariant random equivalence relations
Proceedings of the London Mathematical Society, Volume 132, Issue 5, May 2026.Abstract We characterize exactness of a countable group Γ$\Gamma$ in terms of invariant random equivalence relations (IREs) on Γ$\Gamma$. Specifically, we show that Γ$\Gamma$ is exact if and only if every weak limit of finite IREs is an amenable IRE.
Héctor Jardón‐Sánchez +3 more
wiley +1 more source