Results 1 to 10 of about 893,053 (74)
ON THE PROPAGATION OF EQUATORIAL WAVES INTERACTING WITH A NON-UNIFORM CURRENT [PDF]
Open Communications in Nonlinear Mathematical Physics, 2022 We consider the propagation of equatorial waves of small amplitude, in a flow with an underlying non-uniform current. Without making the too restrictive rigid-lid approximation, by exploiting the available Hamiltonian structure of the problem, we derive ...
Emil Novruzov
doaj +1 more source
A variant of the Recoil Growth algorithm to generate multi-polymer systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The Recoil Growth algorithm, proposed in 1999 by Consta $\textit{et al.}$, is one of the most efficient algorithm available in the literature to sample from a multi-polymer system.
Florian Simatos
doaj +1 more source
Random Records and Cuttings in Split Trees: Extended Abstract [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We study the number of records in random split trees on $n$ randomly labelled vertices. Equivalently the number of random cuttings required to eliminate an arbitrary random split tree can be studied.
Cecilia Holmgren
doaj +1 more source
Bifurcations in Boolean Networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 This paper characterizes the attractor structure of synchronous and asynchronous Boolean networks induced by bi-threshold functions. Bi-threshold functions are generalizations of standard threshold functions and have separate threshold values for the ...
Chris Kuhlman +3 more
doaj +1 more source
A note on the fragmentation of a stable tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We introduce a recursive algorithm generating random trees, which we identify as skeletons of a continuous, stable tree. We deduce a representation of a fragmentation process on these trees.
Philippe Marchal
doaj +1 more source
Freezing, Bounded-Change and Convergent Cellular Automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes a bounded ...
Nicolas Ollinger, Guillaume Theyssier
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2008 Severini and Mansour introduced $\textit{square polygons}$, as graphical representations of $\textit{square permutations}$, that is, permutations such that all entries are records (left or right, minimum or maximum), and they obtained a nice formula for ...
Enrica Duchi, Dominique Poulalhon
doaj +1 more source
On density of truth of the intuitionistic logic in one variable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj +1 more source
Analytic Combinatorics of the Mabinogion Urn [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The Mabinogion urn is a simple model of the spread of influences amongst versatile populations. It corresponds to a non-standard urn with balls of two colours: each time a ball is drawn, it causes a ball of the other kind to switch its colour.
Philippe Flajolet, Thierry Huillet
doaj +1 more source
Degree distribution in random planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, and moreover that $\sum_k d_k =1$. The proof uses the tools developed by Gimènez and Noy in their solution
Michael Drmota, Omer Gimenez, Marc Noy
doaj +1 more source