相关论文: Topological Mixing of Random Substitutions

Assume that a finite set of points is randomly sampled from a subspace of a metric space. Recent advances in computational topology have provided several approaches to recovering the geometric and topological properties of the underlying…

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…

Matching mechanisms play a central role in operations management across diverse fields including education, healthcare, and online platforms. However, experimentally comparing a new matching algorithm against a status quo presents some…

Composite likelihoods are a class of alternatives to the full likelihood which are widely used in many situations in which the likelihood itself is intractable. A composite likelihood may be computed without the need to specify the full…

In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…

We prove that any unimodular Pisot substitution subshift is measurably conjugate to a domain exchange in an Euclidean space which is a finite topological extension of a translation on a torus.This generalizes the pioneer works of Rauzy and…

The study of toppling on permutations with an extra labeled chip was initiated by the first author with D. Hathcock and P. Tetali (arXiv:2010.11236), where the extra chip was added in the middle. We extend this to all possible locations $p$…

A substitution $\vp$ is strong Pisot if its abelianization matrix is non-singular and all eigenvalues except the Perron-Frobenius eigenvalue have modulus less than one. For strong Pisot $\vp$ that satisfies a no cycle condition and for…

We study the cohomology of symbolic dynamical systems called homshifts: they are the nearest-neighbour $\mathbb{Z}^d$ shifts of finite type whose adjacency rules are the same in every direction. Building on the work of Klaus Schmidt…

Predictive recursion is an accurate and computationally efficient algorithm for nonparametric estimation of mixing densities in mixture models. In semiparametric mixture models, however, the algorithm fails to account for any uncertainty in…

We study a non standard mixed formulation of the Poisson problem, sometimes known as dual mixed formulation. For reasons related to the equilibration of the flux, we use finite elements that are conforming in H(div) for the approximation of…

In this paper, various Homological Conjectures are studied for local rings which are locally finitely generated over a discrete valuation ring $V$ of mixed characteristic. Typically, we can only conclude that a particular Conjecture holds…

Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…

Mixture models have received considerable attention recently and Newton [Sankhy\={a} Ser. A 64 (2002) 306--322] proposed a fast recursive algorithm for estimating a mixing distribution. We prove almost sure consistency of this recursive…

Motivated from the study of multiple ergodic average, the investigation of multiplicative shift spaces has drawn much of interest among researchers. This paper focuses on the relation of topologically mixing properties between…

Probabilistic finite mixture models are widely used for unsupervised clustering. These models can often be improved by adapting them to the topology of the data. For instance, in order to classify spatially adjacent data points similarly,…

We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems described by $S$-adic structures satisfying natural mild conditions, such as recognizability and primitiveness. Under the additional assumptions…

In this paper, we study the descriptive set theoretic complexity of the equivalence relation of conjugacy of Toeplitz subshifts of a residually finite group $G$. On the one hand, we show that if $G = \mathbb{Z}$, then topological conjugacy…

We introduce and study two properties of dynamical systems: topologically transitive and topologically mixing under the set-valued setting. We prove some implications of these two topological properties for set-valued functions and…

The "simplicial complexes" and "join" (*) today used within combinatorics aren't the classical concepts, cf. Spanier (1966) p. 108-9, but, exept for \emptyset, complexes having {\emptyset} as a subcomplex resp. \Sigma1 * \Sigma2 := {\sigma1…