Related papers: The recombination equation for interval partitions
Using continuation methods, we study the global solution structure of periodic solutions for a class of periodically forced equations, generalizing the case of relativistic pendulum. We obtain results on the existence and multiplicity of…
Let $N(\tau)$ be a renewal process for independent holding times $\{X_i\}_{k \ge 0}$ ,where $\{X_k\}_{k\ge 1}$ are identically distributed with density $p(x)$. If the associated residual time $R(\tau)$ has a density $u(x,\tau)$, its…
We give explicit formulas for ruin probabilities in a multidimensional Generalized Gambler's ruin problem. The generalization is best interpreted as a game of one player against $d$ other players, allowing arbitrary winning and losing…
The classical persistence algorithm computes the unique decomposition of a persistence module implicitly given by an input simplicial filtration. Based on matrix reduction, this algorithm is a cornerstone of the emergent area of topological…
We study a nonlinear recombination model from population genetics as a combinatorial version of the Kac-Boltzmann equation from kinetic theory. Following Kac's approach, the nonlinear model is approximated by a mean field linear evolution…
The equilibrium statistical mechanics of one-dimensional lattice gases with interactions of arbitrary range and shape between first-neighbor atoms is solved exactly on the basis of statistically interacting vacancy particles. Two sets of…
The self-similar growth-fragmentation equation describes the evolution of a medium in which particles grow and divide as time proceeds, with the growth and splitting of each particle depending only upon its size. The critical case of the…
We completely determine all distributive, codistributive, standard, costandard, and neutral elements in the lattice of overcommutative semigroup varieties, thus correcting a gap contained in an earlier article by the second author.
Continuous-time algebraic Riccati equations can be found in many disciplines in different forms. In the case of small-scale dense coefficient matrices, stabilizing solutions can be computed to all possible formulations of the Riccati…
It is investigated how two (standard or generalized) $\lambda-$symmetries of a given second-order ordinary differential equation can be used to solve the equation by quadratures. The method is based on the construction of two commuting…
Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…
Splitting methods have emerged as powerful tools to address complex problems by decomposing them into smaller solvable components. In this work, we develop a general approach to forward-backward splitting methods for solving monotone…
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…
This article presents a general approach akin to domain-decomposition methods to solve a single linear PDE, but where each subdomain of a partitioned domain is associated to a distinct variational formulation coming from a mutually…
It is well-known that the Liouville equation of statistical mechanics is restricted to systems where the total number of particles (N) is fixed. In this paper, we show how the Liouville equation can be extended to systems where the number…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for these ensembles the BDD problem is NP-hard in the worst case.…
We develop a new Markov chain on graph partitions that makes relatively global moves yet is computationally feasible to be used as the proposal in the Metropolis-Hastings method. Our resulting algorithm can be made reversible and able to…