Searcharxiv⌕ Search

arXiv subjects

Stephan Ramon Garcia

Publications and source records attributed to Stephan Ramon Garcia.

At least 37 records · Page 2Linked to original sources
arXiv2023

Norms on complex matrices induced by random vectors II: extension of weakly unitarily invariant norms

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to extend the main theorem in [7] from exponent $d\geq 2$ to $d \geq 1$. Our proofs are much simpler than the originals: they do not require Lewis' framework for group invariance in convex matrix analysis. This clarification puts the entire theory on simpler foundations while extending its range of applicability.

math.FA↗
arXiv2023

Symmetric tensor powers of graphs

The symmetric tensor power of graphs is introduced and its fundamental properties are explored. A wide range of intriguing phenomena occur when one considers symmetric tensor powers of familiar graphs. A host of open questions are presented, hoping to spur future research.

math.CO↗
arXiv2023

The Reciprocal Schur Inequality

Schur's inequality states that the sum of three special terms is always nonnegative. This note is a short review of inequalities for the sum of the reciprocals of these terms and of extensions of the latter inequalities to an arbitrary number of terms and thus to higher-order divided differences.

math.FA↗
arXiv2023

The strongly Leibniz property and the Gromov--Hausdorff propinquity

We construct a new version of the dual Gromov--Hausdorff propinquity that is sensitive to the strongly Leibniz property. In particular, this new distance is complete on the class of strongly Leibniz quantum compact metric spaces. Then, given an inductive limit of C*-algebras for which each C*-algebra of the inductive limit is equipped with a strongly Leibniz L-seminorm, we provide sufficient conditions for placing a strongly Leibniz L-seminorm on an inductive limit such that the inductive sequence converges to the inductive limit in this new Gromov--Hausdorff propinquity. As an application, we place new strongly Leibniz L-seminorms on AF-algebras using Frobenius--Rieffel norms, for which we have convergence of the Effros--Shen algebras in the Gromov--Hausdorff propinquity with respect to their irrational parameter.

math.OA↗
arXiv2022

Norms on Complex Matrices Induced by Random Vectors

We introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. As a consequence, we obtain a generalization of Hunter's positivity theorem for the complete homogeneous symmetric polynomials.

math.FA↗
arXiv2022

Frobenius-Rieffel norms on finite-dimensional C*-algebras

In 2014, Rieffel introduced norms on certain unital C*-algebras built from conditional expectations onto unital C*-subalgebras. We begin by showing that these norms generalize the Frobenius norm, and we provide explicit formulas for certain conditional expectations onto unital C*-subalgebras of finite-dimensional C*-algebras. This allows us compare these norms to the operator norm by finding explicit equivalence constants. In particular, we find equivalence constants for the standard finite-dimensional C*-subalgebras of the Effros-Shen algebras that vary continuously with respect to their given irrational parameters.

math.OA↗
arXiv2022

Norms on complex matrices induced by complete homogeneous symmetric polynomials

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. Our norms enjoy many desirable analytic and algebraic properties, such as an elegant determinantal interpretation and the ability to distinguish certain graphs that other matrix norms cannot. Furthermore, they give rise to new dimension-independent tracial inequalities. Their potential merits further investigation.

math.CO↗
arXiv2021

Factorization length distribution for affine semigroups IV: a geometric approach to weighted factorization lengths in three-generator numerical semigroups

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many previous results, provides more natural and intuitive proofs, and yields a completely explicit error bound.

math.CO↗
arXiv2021

An improved uncertainty principle for functions with symmetry

Chebotarëv proved that every minor of a discrete Fourier matrix of prime order is nonzero. We prove a generalization of this result that includes analogues for discrete cosine and discrete sine matrices as special cases. We establish these results via a generalization of the Biró-Meshulam-Tao uncertainty principle to functions with symmetries that arise from certain group actions, with some of the simplest examples being even and odd functions. We show that our result is best possible and in some cases is stronger than that of Biró-Meshulam-Tao. Some of these results hold in certain circumstances for non-prime fields; Gauss sums play a central role in such investigations.

math.CA↗
arXiv2021

Unconditional Explicit Mertens' Theorems for Number Fields and Dedekind Zeta Residue Bounds

We obtain unconditional, effective number-field analogues of the three Mertens' theorems, all with explicit constants and valid for $x\geq 2$. Our error terms are explicitly bounded in terms of the degree and discriminant of the number field. To this end, we provide unconditional bounds, with explicit constants, for the residue of the corresponding Dedekind zeta function at $s=1$.

math.NT↗
arXiv2020

A Gallery of Gaussian Periods

Gaussian periods are certain sums of roots of unity whose study dates back to Gauss's seminal work in algebra and number theory. Recently, large scale plots of Gaussian periods have been revealed to exhibit striking visual patterns, some of which have been explored in the second named author's prior work. In 2020, the first named author produced a new app, \texttt{Gaussian periods}, which allows anyone to create these plots much more efficiently and at a larger scale than before. In this paper, we introduce Gaussian periods, present illustrations created with the new app, and summarize how mathematics controls some visual features, including colorings left unexplained in earlier work.

math.NT↗
arXiv2020

An effective analytic formula for the number of distinct irreducible factors of a polynomial

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related sum over rational primes. For a given $f \in \mathbb{Z}[x]$, our result yields a finite list of primes that certifies the number of distinct irreducible factors of $f$.

math.NT↗
arXiv2020

Factorization length distribution for affine semigroups II: asymptotic behavior for numerical semigroups with arbitrarily many generators

For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length statistics. This involves a variety of tools that are not standard in the subject, such as algebraic combinatorics (Schur polynomials), probability theory (weak convergence of measures, characteristic functions), and harmonic analysis (Fourier transforms of distributions). We provide instructive examples which demonstrate the power and generality of our techniques. We also highlight unexpected consequences in the theory of homogeneous symmetric functions.

math.CO↗
arXiv2020

Factorization length distribution for affine semigroups III: modular equidistribution for numerical semigroups with arbitrarily many generators

For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization lengths are equidistributed across all congruence classes that are not trivially ruled out by modular considerations.

math.CO↗