Searcharxiv⌕ Search

arXiv subjects

András Zsák

Publications and source records attributed to András Zsák.

8 recordsLinked to original sources
arXiv2025

Lower-Order Refinements of Greedy Approximation

For two countable ordinals $α$ and $β$, a basis of a Banach space $X$ is said to be $(α, β)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_α$-unconditional but not $\mathcal{S}_{α+1}$-unconditional, and 3) $\mathcal{S}_β$-democratic but not $\mathcal{S}_{β+1}$-democratic. If $α$ or $β$ is replaced with $\infty$, then the basis is required to be unconditonal or democratic, respectively. Previous work constructed a $(0,0)$-quasi-greedy basis, an $(α, \infty)$-quasi-greedy basis, and an $(\infty, α)$-quasi-greedy basis. In this paper, we construct $(α, β)$-quasi-greedy bases for $β\le α+1$ (except the already solved case $α= β= 0$).

math.FA↗
arXiv2024

Random Geometric Graphs in Reflexive Banach Spaces

We investigate a random geometric graph model introduced by Bonato and Janssen. The vertices are the points of a countable dense set $S$ in a (necessarily separable) normed vector space $X$, and each pair of points are joined independently with some fixed probability $p$ (with $0<p<1$) if they are less than distance $1$ apart. A countable dense set $S$ in a normed space is Rado, if the resulting graph is almost surely unique up to isomorphism: that is any two such graphs are, almost surely, isomorphic. Not surprisingly, understanding which sets are Rado is closely related to the geometry of the underlying normed space. It turns out that a key question is in which spaces must step-isometries (maps that preserve the integer parts of distances) on dense subsets necessarily be isometries. We answer this question for a large class of Banach spaces including all strictly convex reflexive spaces. In the process we prove results on the interplay between the norm topology and weak topology that may be of independent interest. As a consequence of these Banach space results we show that almost all countable dense sets in strictly convex reflexive spaces are strongly non-Rado (that is, any two graphs are almost surely non-isomorphic). However, we show that there do exist Rado sets even in $\ell_2$. Finally we construct a Banach spaces in which all countable dense set are strongly non-Rado.

math.FA↗
arXiv2020

Stochastic approximation of lamplighter metrics

We observe that embeddings into random metrics can be fruitfully used to study the $L_1$-embeddability of lamplighter graphs or groups, and more generally lamplighter metric spaces. Once this connection has been established, several new upper bound estimates on the $L_1$-distortion of lamplighter metrics follow from known related estimates about stochastic embeddings into dominating tree-metrics. For instance, every lamplighter metric on a $n$-point metric space embeds bi-Lipschitzly into $L_1$ with distortion $O(\log n)$. In particular, for every finite group $G$ the lamplighter group $H = \mathbb{Z}_2\wr G$ bi-Lipschitzly embeds into $L_1$ with distortion $O(\log\log|H|)$. In the case where the ground space in the lamplighter construction is a graph with some topological restrictions, better distortion estimates can be achieved. Finally, we discuss how a coarse embedding into $L_1$ of the lamplighter group over the $d$-dimensional infinite lattice $\mathbb{Z}^d$ can be constructed from bi-Lipschitz embeddings of the lamplighter graphs over finite $d$-dimensional grids, and we include a remark on Lipschitz free spaces over finite metric spaces.

math.MG↗
arXiv2020

On the bi-Lipschitz geometry of lamplighter graphs

In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter graphs over countable trees bi-Lipschitzly embed into $\ell_1$. We study the metric behaviour of the operation of taking the lamplighter graph over the vertex-coalescence of two graphs. Based on this analysis, we provide metric characterizations of superreflexivity in terms of lamplighter graphs over star graphs or rose graphs. Finally, we show that the presence of a clique in a graph implies the presence of a Hamming cube in the lamplighter graph over it. An application is a characterization in terms of a sequence of graphs with uniformly bounded degree of the notion of trivial Bourgain-Milman-Wolfson type for arbitrary metric spaces, similar to Ostrovskii's characterization previously obtained in \cite{ostrovskii:11}.

math.MG↗
arXiv2010

Dichotomy theorems for random matrices and closed ideals of operators on $\big(\bigoplus_{n=1}^\infty\ell_1^n \big)_{\mathrm{c}_0}$

We prove two dichotomy theorems about sequences of operators into $L_1$ given by random matrices. In the second theorem we assume that the entries of each random matrix form a sequence of independent, symmetric random variables. Then the corresponding sequence of operators either uniformly factor the identity operators on $\ell_1^k$ $(k\in\mathbb N$) or uniformly approximately factor through $\mathrm{c}_0$. The first theorem has a slightly weaker conclusion still related to factorization properties but makes no assumption on the random matrices. Indeed, it applies to operators defined on an arbitrary sequence of Banach spaces. These results provide information on the closed ideal structure of the Banach algebra of all operators on the space $\big(\bigoplus_{n=1}^\infty\ell_1^n \big)_{\mathrm{c}_0}$.

math.FA↗
arXiv2007

A new infinite game in Banach spaces with applications

We consider the following two-player game played on a separable, infinite-dimensional Banach space X. Player S chooses a positive integer k_1 and a finite-codimensional subspace X_1 of X. Then player P chooses x_1 in the unit sphere of X_1. Moves alternate thusly, forever. We study this game in the following setting. Certain normalized, 1-unconditional sequences (u_i) and (v_i) are fixed so that S has a winning strategy to force P to select x_i's so that if the moves are (k_1,X_1,x_1,k_2,X_2,x_2,...), then (x_i) is dominated by (u_{k_i}) and/or (x_i) dominates (v_{k_i}). In particular, we show that for suitable (u_i) and (v_i) if X is reflexive and S can win both of the games above, then X embeds into a reflexive space Z with an FDD which also satisfies analogous block upper (u_i) and lower (v_i) estimates. Certain universal space consequences ensue.

math.FA↗
arXiv2007

Banach spaces of bounded Szlenk index

For a countable ordinal a we denote by C_a the class of separable, reflexive Banach spaces whose Szlenk index and the Szlenk index of their dual are bounded by a. We show that each C_a admits a separable, reflexive universal space. We also show that spaces in the class C_{omega^{a*omega}} embed into spaces of the same class with a basis. As a consequence we deduce that each C_a is analytic in the Effros-Borel structure of subspaces of C[0,1].

math.FA↗