相关论文: Regenerative partition structures

A simple explicit construction is provided of a partition-valued fragmentation process whose distribution on partitions of $[n]=\{1,...,n\}$ at time $\theta \ge 0$ is governed by the Ewens sampling formula with parameter $\theta$. These…

We analyse the long term behaviour of the measure-valued solutions of a class of linear renewal equations modelling physiologically structured populations. The renewal equations that we consider are characterised by a regularisation…

The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…

Inspired by protein folding, we explored the construction of three-dimensional structures and machines from one-dimensional chains of simple building blocks. This approach not only allows us to recreate the self-replication mechanism…

In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…

A method of Proctor [European J. Combin. 5 (1984), no. 4, 331-350] realizes the set of arbitrary plane partitions in a box and the set of symmetric plane partitions as bases of linear representations of Lie groups. We extend this method by…

We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…

In this paper, we extend the work of Andrews, Beck and Hopkins by considering partitions and compositions with bounded gaps between each pair of consecutive parts. We show that both their generating functions and two matrices determined by…

Consider the Markov process taking values in the partitions of N such that each pair of blocks merges at rate one, and each integer is eroded, i.e., becomes a singleton block, at rate d. This is a special case of exchangeable…

We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…

We provide a general construction of quantum generalized master equations with memory kernel leading to well defined, that is completely positive and trace preserving, time evolutions. The approach builds on an operator generalization of…

We prove a structure theorem for multiplicative functions on the Gaussian integers, showing that every bounded multiplicative function on the Gaussian integers can be decomposed into a term which is approximately periodic and another which…

Can a large system be fully characterized using its subsystems via inductive reasoning? Is it possible to completely reduce the behavior of a complex system to the behavior of its simplest "atoms"? In the following paper we answer these…

We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…

We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…

The decomposition of polynomial spaces on unions of Grassmannians $\mathcal G_{{k_1},d}\cup\ldots\cup \mathcal G_{{k_r},d}$ into irreducible orthogonally invariant subspaces and their reproducing kernels are investigated. We also generalize…

The standard generators of tridiagonal algebras, recently introduced by Terwilliger, are shown to generate a new (in)finite family of mutually commuting operators which extends the Dolan-Grady construction. The involution property relies on…

Every exchangeable Feller process taking values in a suitably nice combinatorial state space can be constructed by a system of iterated random Lipschitz functions. In discrete time, the construction proceeds by iterated application of…

Stochastic models share many characteristics with generic parametric models. In some ways they can be regarded as a special case. But for stochastic models there is a notion of weak distribution or generalised random variable, and the same…

We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…