Related papers: Constructing Toeplitz arrays via cut and project s…
We review the theory of Toeplitz extensions and their role in operator K-theory, including Kasparov's bivariant K-theory. We then discuss the recent applications of Toeplitz algebras in the study of solid state systems, focusing in…
This manuscript bridges nonparametric smoothness-based and shape-restricted estimation, which may appear as two disjoint paradigms in the field. The proposed approach is motivated by a conceptually simple observation: every Lipschitz…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…
We consider the interval $]{-1},1[$ and intend to endow it with an algebraic structure like a ring. The motivation lies in decision making, where scales that are symmetric w.r.t. 0 are needed in order to represent a kind of symmetry in the…
This work is devoted to the study of families of infinite parabolic iterated function systems (PIFS) on a closed interval parametrized by vectors in $\mathbb{R}^d$ with overlaps. We show that the Hausdorff dimension and absolute continuity…
This paper introduces the framework of (local) toric separable geometries, where toric separable K\"ahler geometries come in families, each uniquely determined by an underlying factorization structure. This unifying framework captures all…
We study the construction of exponential frames and Riesz sequences for a class of fractal measures on ${\mathbb R}^d$ generated by infinite convolution of discrete measures using the idea of frame towers and Riesz-sequence towers. The…
Two approaches to Lipschitz structures for any set are presented, studied and compared. The first approach is similar to the one proposed in Fraser, Jr. R. B., Axiom systems for Lipschitz structures, Fundamenta Mathematicae, (1970), where…
We define topologically semiperfect (complete, separated, right linear) topological rings and characterize them by equivalent conditions. We show that the endomorphism ring of a module, endowed with the finite topology, is topologically…
We study ergodic finite and infinite measures defined on the path space $X_B$ of a Bratteli diagram $B$ which are invariant with respect to the tail equivalence relation on $X_B$. Our interest is focused on measures supported by vertex and…
For a class of Fibonacci-like unimodal maps, the restriction to the $\omega$-limit set of the unique turning point defines a minimal Cantor system. We construct these Cantor sets geometrically using a nested sequence of finite covers with a…
The power structure over the Grothendieck (semi)ring of complex quasi-projective varieties constructed by the authors is used to express the generating series of classes of Hilbert schemes of zero-dimensional subschemes on a smooth…
We construct exponential maps for which the singular value tends to infinity under iterates while the maps are ergodic. This is in contrast with a result of Lyubich from 1987 which tells that $e^z$ is not ergodic.
Augmented designs are typically used in early-stage breeding programs to compare single replicates of test entries by combining them with replicated check varieties. One or two dimensional incomplete blocking can be incorporated in the…
A variation of Dyck paths allows for down-steps of arbitrary length, not just one. This is motivated by ideas due to Emeric Deutsch. We use the adding-a-new-slice technique and the kernel method to compute the number of maximal runs of…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
We consider problems of estimation of structured covariance matrices, and in particular of matrices with a Toeplitz structure. We follow a geometric viewpoint that is based on some suitable notion of distance. To this end, we overview and…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…