Related papers: Constructing Toeplitz arrays via cut and project s…

We construct model sets arising from cut and project schemes in Euclidean spaces whose associated Delone dynamical systems have positive toplogical entropy. The construction works both with windows that are proper and with windows that have…

This paper establishes relationships between elliptic functions and Riordan arrays leading to new classes of Riordan arrays which here are called elliptic Riordan arrays. In particular, the case of Riordan arrays derived from Jacobi…

Given a closed orientable surface (\Sigma) of genus at least two, we establish an affine isomorphism between the convex compact set of isotopy-invariant topological measures on (\Sigma) and the convex compact set of additive functions on…

For a class of irrational numbers, depending on their Diophantine properties, we construct explicit rank-one transformations that are totally ergodic and not weakly mixing. We classify when the measure is finite or infinite. In the finite…

This work considers Maximum Likelihood Estimation (MLE) of a Toeplitz structured covariance matrix. In this regard, an equivalent reformulation of the MLE problem is introduced and two iterative algorithms are proposed for the optimization…

We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…

This work considers Maximum Likelihood Estimation (MLE) of a Toeplitz structured covariance matrix. In this regard, an equivalent reformulation of the MLE problem is introduced and two iterative algorithms are proposed for the optimization…

We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…

We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…

Bratteli diagrams with countably infinite levels exhibit a new phenomenon: they can be horizontally stationary. The incidence matrices of these horizontally stationary Bratteli diagrams are infinite banded Toeplitz matrices. In this paper,…

In this paper we present a new family of discrete sequences having "random like" uniformly decaying auto-correlation properties. The new class of infinite length sequences are higher order chirps constructed using irrational numbers.…

Motivated mainly by applications to partial differential equations with random coefficients, we introduce a new class of Monte Carlo estimators, called Toeplitz Monte Carlo (TMC) estimator for approximating the integral of a multivariate…

The stories told in this paper are dealing with the solution of finite, infinite, and biinfinite Toeplitz-type systems. A crucial role plays the off-diagonal decay behavior of Toeplitz matrices and their inverses. Classical results of…

The recent theorem by D. Luecking that finite rank Toeplitz-Bergman operators must be generated by a measure consisting of finitely many point masses is carried over to the many-dimensional case.

We introduce a construction and an algorithm, both based on Topological Data Analysis (TDA), to tackle the problem of the isomorphism check of Orthogonal Arrays (OAs). Specifically, we associate to any binary OA a persistence diagram, one…

The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing…

We define a metric ultraproduct of topological groups with left-invariant metric, and show that there is a countable sequence of finite groups with left-invariant metric whose metric ultraproduct contains isometrically as a subgroup every…

We compute an explicit representation of the (topological) automorphism group or a particular Toeplitz subshift. The automorphism group is a (non-finitely generated) subgroup of rational numbers under addition and the shift map corresponds…

Superregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has…

Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, $\mathbf{E}_\mathrm{in}$ and $\mathbf{E}_\mathrm{out}$, to produce an adjacency…