Related papers: The recombination equation for interval partitions
The fragmentation processes of exchangeable partitions have already been studied by several authors. In this paper, we examine rather fragmentation of exchangeable compositions, that means partitions of $\mathbb{N}$ where the order of the…
In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…
A generalized exponential matrix based on the construction of kernel operators for generalized summability is defined and analyzing its main properties, generalizing the classical exponential matrix and fractional exponential matrix. This…
We consider fragmentation processes with values in the space of marked partitions of $\mathbb{N}$, i.e. partitions where each block is decorated with a nonnegative real number. Assuming that the marks on distinct blocks evolve as…
In this note we consider several kind of partition functions of one-dimensional models with nearest - neighbor interactions $I_n, n\in \mathbf{Z}$ and spin values $\pm 1$. We derive systems of recursive equations for each kind of such…
In topological data analysis, two-parameter persistence can be studied using the representation theory of the 2d commutative grid, the tensor product of two Dynkin quivers of type A. In a previous work, we defined interval approximations…
Fragmentation processes are part of a broad class of models describing the evolution of a system of particles which split apart at random. These models are widely used in biology, materials science and nuclear physics, and their asymptotic…
Motivated by robust matrix recovery problems such as Robust Principal Component Analysis, we consider a general optimization problem of minimizing a smooth and strongly convex loss function applied to the sum of two blocks of variables,…
The Jacobi system on a full-line lattice is considered when it contains additional weight factors. A factorization formula is derived expressing the scattering from such a generalized Jacobi system in terms of the scattering from its…
In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures encoding input and output objects of elimination theory (i.e. polynomial equation systems)…
Generalized parton distributions provide information on the longitudinal and transverse distribution of partons in the fast moving nucleon. Furthermore, they contain information on the spin structure of the nucleon. First results of a…
A birth-death process is a continuous-time Markov chain that counts the number of particles in a system over time. In the general process with $n$ current particles, a new particle is born with instantaneous rate $\lambda_n$ and a particle…
In neuroscience, the time elapsed since the last discharge has been used to predict the probability of the next discharge. Such predictions can be improved taking into account the last two discharge times, and possibly more. Such multi-time…
This paper is about how to partition decision variables while decomposing a large-scale optimization problem for the best performance of distributed solution methods. Solving a large-scale optimization problem sequen- tially can be…
We utilize degenerate perturbation theory to investigate continuous-time quantum search on second-order truncated simplex lattices. In this work, we show that the construction of the Hamiltonian must consider the structure of the lattice.…
We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…
Using the language of non-relativistic effective Lagrangians, we formulate a systematic framework for the calculation of resonance matrix elements in lattice QCD. The generalization of the L\"uscher-Lellouch formula for these matrix…
Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.
The determination of solutions of the Jacobi partial differential equations (PDEs) for finite-dimensional Poisson systems is considered. In particular, a novel procedure for the construction of solution families is developed. Such a…
The matrix differential equation $x'(t) = Q(t)x(t), x(0) = x_0$ is considered in the case where $Q(t)$ is an unspecified matrix function of time, with the only constraint that $Q(t)\in \mset$ for every $t$, where $\mset$ is a prescribed…