Searcharxiv⌕ Search

arXiv subjects

Stephan Ramon Garcia

Publications and source records attributed to Stephan Ramon Garcia.

At least 73 records · Page 4Linked to original sources

Lattices from tight equiangular frames

We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the $k$-dimensional Euclidean space. We show that this is not the case if the cosine of the angle of the frame is irrational. We also prove that the set is a lattice for $n = k+1$ and that there are infinitely many $k$ such that a lattice emerges for $n = 2k$. We dispose of all cases in dimensions $k$ at most $9$. In particular, we show that a $(7,28)$ frame generates a strongly eutactic lattice and give an alternative proof of Roland Bacher's recent observation that this lattice is perfect.

math.FA↗

Finite Blaschke products: a survey

A finite Blaschke product is a product of finitely many automorphisms of the unit disk. This brief survey covers some of the main topics in the area, including characterizations of finite Blaschke products, approximation theorems, derivatives and residues of finite Blaschke products, geometric localization of zeros, and selected other topics.

math.CV↗

On the similarity of AB and BA for normal and other matrices

It is well-known that $AB$ and $BA$ are similar when $A$ and $B$ are complex square Hermitian matrices. In this note we answer a question of F. Zhang by demonstrating that similarity can fail if $A$ is Hermitian and $B$ is normal. Perhaps surprisingly, similarity does hold when $A$ is positive semidefinite and $B$ is normal.

math.FA↗

Real complex functions

We survey a few classes of analytic functions on the disk that have real boundary values almost everywhere on the unit circle. We explore some of their properties, various decompositions, and some connections these functions make to operator theory.

math.CV↗

Partial orders on partial isometries

This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than another with respect to these pre-orders is equivalent to the existence of a bounded (or isometric) multiplier between two natural reproducing kernel Hilbert spaces of analytic functions. For large classes of partial isometries these spaces can be realized as the well-known model subspaces and deBranges-Rovnyak spaces. This characterization is applied to investigate properties of these pre-orders and the equivalence classes they generate.

math.FA↗

Gauss' hidden menagerie: from cyclotomy to supercharacters

Gaussian periods, when viewed appropriately, exhibit a dazzling and eclectic host of visual qualities. This brief survey reviews the historical context and summarizes our current knowledge of graphical properties of Gaussian periods.

math.NT↗

Visual properties of generalized Kloosterman sums

For a positive integer $m$ and a subgroup $Λ$ of the unit group $(\mathbb{Z}/m\mathbb{Z})^\times$, the corresponding generalized Kloosterman sum is the function $K(a,b,m,Λ) = \sum_{u \in Λ}e(\frac{au + bu^{-1}}{m})$. Unlike classical Kloosterman sums, which are real valued, generalized Kloosterman sums display a surprising array of visual features when their values are plotted in the complex plane. In a variety of instances, we identify the precise number-theoretic conditions that give rise to particular phenomena.

math.NT↗

Lattices from Hermitian function fields

We consider the well-known Rosenbloom-Tsfasman function field lattices in the special case of Hermitian function fields. We show that in this case the resulting lattices are generated by their minimal vectors, provide an estimate on the total number of minimal vectors, and derive properties of the automorphism groups of these lattices. Our study continues previous investigations of lattices coming from elliptic curves and finite Abelian groups. The lattices we are faced with here are more subtle than those considered previously, and the proofs of the main results require the replacement of the existing linear algebra approaches by deep results of Gerhard Hiss on the factorization of functions with particular divisor support into lines and their inverses.

math.NT↗

Toeplitz determinants with perturbations in the corners

The paper is devoted to exact and asymptotic formulas for the determinants of Toeplitz matrices with perturbations by blocks of fixed size in the four corners. If the norms of the inverses of the unperturbed matrices remain bounded as the matrix dimension goes to infinity, then standard perturbation theory yields asymptotic expressions for the perturbed determinants. This premise is not satisfied for matrices generated by so-called Fisher-Hartwig symbols. In that case we establish formulas for pure single Fisher-Hartwig singularities and for Hermitian matrices induced by general Fisher-Hartwig symbols.

math.FA↗

On lattices generated by finite Abelian groups

This paper is devoted to the study of lattices generated by finite Abelian groups. Special species of such lattices arise in the exploration of elliptic curves over finite fields. In case the generating group is cyclic, they are also known as the Barnes lattices. It is shown that for every finite Abelian group with the exception of the cyclic group of order four these lattices have a basis of minimal vectors. Another result provides an improvement of a recent upper bound by Min Sha for the covering radius in the case of the Barnes lattices. Also discussed are properties of the automorphism groups of these lattices.

math.NT↗

Mathematical and physical aspects of complex symmetric operators

Recent advances in the theory of complex symmetric operators are presented and related to current studies in non-hermitian quantum mechanics. The main themes of the survey are: the structure of complex symmetric operators, $C$-selfadjoint extensions of $C$-symmetric unbounded operators, resolvent estimates, reality of spectrum, bases of $C$-orthonormal vectors, and conjugate-linear symmetric operators. The main results are complemented by a variety of natural examples arising in field theory, quantum physics, and complex variables.

math.FA↗

Supercharacters, exponential sums, and the uncertainty principle

The theory of supercharacters, which generalizes classical character theory, was recently introduced by P. Diaconis and I.M. Isaacs, building upon earlier work of C. Andre. We study supercharacter theories on $(Z/nZ)^d$ induced by the actions of certain matrix groups, demonstrating that a variety of exponential sums of interest in number theory (e.g., Gauss, Ramanujan, Heilbronn, and Kloosterman sums) arise in this manner. We develop a generalization of the discrete Fourier transform, in which supercharacters play the role of the Fourier exponential basis. We provide a corresponding uncertainty principle and compute the associated constants in several cases.

math.RT↗

The graphic nature of Gaussian periods

Recent work has shown that the study of supercharacters on abelian groups provides a natural framework within which to study certain exponential sums of interest in number theory. Our aim here is to initiate the study of Gaussian periods from this novel perspective. Among other things, our approach reveals that these classical objects display dazzling visual patterns of great complexity and remarkable subtlety.

math.NT↗

An extremal problem for characteristic functions

Suppose $E$ is a subset of the unit circle $\mathbb{T}$ and $H^\infty\subset L^\infty$ is the Hardy subalgebra. We examine the problem of finding the distance from the characteristic function of $E$ to $z^nH^\infty$. This admits an alternate description as a dual extremal problem. Precise solutions are given in several important cases. The techniques used involve the theory of Toeplitz and Hankel operators as well as the construction of certain conformal mappings.

math.CV↗

Model spaces: a survey

This is a brief and gentle introduction, aimed at graduate students, to the subject of model subspaces of the Hardy space.

math.CV↗

A method for generating realistic correlation matrices

Simulating sample correlation matrices is important in many areas of statistics. Approaches such as generating Gaussian data and finding their sample correlation matrix or generating random uniform $[-1,1]$ deviates as pairwise correlations both have drawbacks. We develop an algorithm for adding noise, in a highly controlled manner, to general correlation matrices. In many instances, our method yields results which are superior to those obtained by simply simulating Gaussian data. Moreover, we demonstrate how our general algorithm can be tailored to a number of different correlation models. Using our results with a few different applications, we show that simulating correlation matrices can help assess statistical methodology.

math.ST↗

Four quotient set gems

Our aim in this note is to present four remarkable facts about quotient sets. These observations seem to have been overlooked by the Monthly, despite its intense coverage of quotient sets over the years.

math.NT↗