Related papers: Maximizing measures for countable alphabet shifts …

Given a dynamical system, a characteristic measure is a Borel probability measure invariant under all of its automorphisms. Frisch and Tamuz asked if every symbolic system supports such a measure. Motivated by this problem, we study the…

This paper is concerned with the problem of sampling and interpolation involving derivatives in shift-invariant spaces and the error analysis of the derivative sampling expansions for fundamentally large classes of functions. A new type of…

We give a combinatorial characterization of countable submaximal subspaces of $2^\kappa$. Using a parametrized version of Mathias forcing, we prove that there exists a countable submaximal subspace of $2^{\omega_1}$ whilst…

In this article, we investigate the use of a probabilistic model for unsupervised clustering in text collections. Unsupervised clustering has become a basic module for many intelligent text processing applications, such as information…

We prove that for $\mathcal{C}^{1,\alpha}$ diffeomorphisms on a compact manifold $M$ with ${\rm dim} M\leq 3$, if an invariant measure $\mu$ is a continuity point of the sum of positive Lyapunov exponents, then $\mu$ is an upper…

A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…

As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting…

Recalibration of binary probabilistic classifiers to a target prior probability is an important task in areas like credit risk management. However, recalibration of a classifier learned on a training dataset to a target on a test dataset in…

We are concerned in clustering continuous data sets subject to non-ignorable missingness. We perform clustering with a specific semi-parametric mixture, under the assumption of conditional independence given the component. The mixture model…

We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…

Recent developemnts in string compactifications in the presence of antisymmetric field backgrounds suggest a new simple and predictive structure for soft terms in the MSSM depending only on two parameters. They give rise to a positive…

Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. It captures well studied and…

We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then…

We present some partial results regarding subadditivity of maximal shifts in finite graded free resolutions.

A generalization of a-maximization is proposed that maximizes a subject to inequalities rather than equalities. The implication of this conjecture is that in the absence of emergent symmetries, there is a maximum R-charge for fields…

The focus of this article is the approximation of functions which are analytic on a compact interval except at the endpoints. Typical numerical methods for approximating such functions depend upon the use of particular conformal maps from…

We construct a natural invariant measure concentrated on the set of square-free numbers, and invariant under the shift. We prove that the corresponding dynamical system is isomorphic to a translation on a compact, Abelian group. This…

Assuming $\mathfrak b = \mathfrak c$ (or some weaker statement), we construct a compactification $\gamma\omega$ of $\omega$ such that its remainder $\gamma\omega\setminus\omega$ is nonseparable and carries a strictly positive measure.

Utilizing the large-scale unlabeled data from the target domain via pseudo-label clustering algorithms is an important approach for addressing domain adaptation problems in speaker verification tasks. In this paper, we propose a novel…

Hidden shift problems are relevant to assess the quantum security of various cryptographic constructs. Multiple quantum subexponential time algorithms have been proposed. In this paper, we propose some improvements on a polynomial quantum…