Related papers: Decoding Rauzy Induction: An Effective Answer to B…
We study the symmetry resolved entanglement entropies in gapped integrable lattice models. We use the corner transfer matrix to investigate two prototypical gapped systems with a U(1) symmetry: the complex harmonic chain and the XXZ…
Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps that preserve feasibility of the intermediate solutions. In…
We provide a general framework to improve trade-offs between the number of full batch and sample queries used to solve structured optimization problems. Our results apply to a broad class of randomized optimization algorithms that…
Let $R$ be a commutative Noetherian ring, $E$ a non-zero finitely generated $R$-module and $I$ an ideal of $R$. One purpose of this paper is to show that the sequences $\Ass_RE/ \widetilde{I_E^n}$ and $\Ass_R\widetilde{I^n…
For any persistence module $M$ over a finite poset $\mathbf{P}$, and any interval $I$ of $\mathbf{P}$, we give a formula for the multiplicity $d_M(V_I)$ of the interval module $V_I$ in the indecomposable decomposition of $M$ in terms of the…
We consider a family $\{\tau_m:m\geq 2\}$ of interval maps introduced by Hei-Chi Chan [5] as generalizations of the Gauss transformation. For the continued fraction expansion arising from $\tau_m$, we solve its Gauss-Kuzmin-type problem by…
In this short communication, we announce an algorithmic procedure for constructing non-uniqueness counter-examples of classical solutions to initial-boundary-value problems for a wide class of linear evolution partial differential…
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is {\em graphical}…
Thanks to works by M. Kontsevich and A. Zorich followed by C. Boissy, we have a classification of all Rauzy Classes of any given genus. It follows from these works that Rauzy Classes are closed under the operation of inverting the…
In recent years important progress has been achieved towards proving the validity of the replica predictions for the (asymptotic) mutual information (or "free energy") in Bayesian inference problems. The proof techniques that have emerged…
The construction of exact solutions for radiative transfer in a plane-parallel medium has been addressed by Hemsch and Ferziger in 1972 for a partial frequency redistribution model of the formation of spectral lines consisting in a linear…
Transformer models underpin many recent advances in practical machine learning applications, yet understanding their internal behavior continues to elude researchers. Given the size and complexity of these models, forming a comprehensive…
A sequence of random variables is called exchangeable if the joint distribution of the sequence is unchanged by any permutation of the indices. De Finetti's theorem characterizes all $\{0,1\}$-valued exchangeable sequences as a "mixture" of…
Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…
We study linear recurrence and weak mixing of a two-parameter family of interval translation maps $T_{\alpha,\beta}$ for the subset of parameter space where $T_{\alpha,\beta}$ has a Cantor attractor. For this class, there is a procedure…
Run-length decoding is an operation on sequences in which a positive integer $a$ is replaced by a run(sequence of repeated elements) of length $a$. Iterated run-length decodings applied to sequences with alphabets consisting of pairs of…
We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition…
The iterative proportional fitting procedure, introduced in 1937 by Kruithof, aims to adjust the elements of an array to satisfy specified row and column sums. Given a rectangular non-negative matrix $X_0$ and two positive marginals $a$ and…
We propose a general method for constructing a fuzzy cellular automaton from a given cellular automaton. Unlike previous approaches that use fuzzy distinctive normal form, whose update function is restricted to third-order polynomials, our…
By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…