Related papers: $L^p$ Expander Graphs

In a recent paper, we exhibit a link between the average local growth of Laplace eigenfunctions on surfaces and the size of their nodal set. In that paper, the average local growth is computed using the uniform - or $L^\infty$ - growth…

We study the $L^p$-convergence of Fourier expansions in terms of non-symmetric Heckman-Opdam polynomials of type $A_1$. Using kernel estimates and duality arguments, we prove that the partial sums converge in $ L^p([-\pi,\pi],dm_k)$ for…

In this paper we study extremal behaviors of the mean to max ratio of the $p$-torsion function with respect to the geometry of the domain. For $p$ larger than the dimension of the space $N$, we prove that the upper bound is uniformly below…

In this short note, we propose to extend differentiability (with respect to a multidimensional parameter) of a normalized eigenfunction associated to the simple, dominating eigenvalue of the weighted transfer operator for a uniformly…

In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…

We initiate an investigation into how much the existing theory of (nonselfadjoint) operator algebras on a Hilbert space generalizes to algebras acting on L^p spaces. In particular we investigate the applicability of the theory of real…

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

We introduce the notion of a regular mapping on a non-commutative $L_p$-space associated to a hyperfinite von Neumann algebra for $1\le p\le \infty$. This is a non-commutative generalization of the notion of regular or order bounded map on…

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

In this note we show how improved $L^p$-estimates for certain types of quasi-modes are naturally equaivalent to improved operator norms of spectral projection operators associated to shrinking spectral intervals of the appropriate scale.…

Let $Q$ be a first-order differential operator on a compact, smooth oriented Riemannian manifold with smooth boundary. Then, Friedrichs' extension lemma states that the minimal closed extension $Q_{min}$ (the closure of the graph) and the…

We consider exponential large deviations estimates for unbounded observables on uniformly expanding dynamical systems. We show that uniform expansion does not imply the existence of a rate function for unbounded observables no matter the…

We establish operator norm bounds for bipartite tensor sums of self-adjoint contractions. The inequalities generalize the analytic structure underlying the Tsirelson and CHSH bounds, giving dimension-free estimates expressed through…

Let $p$ be a prime number. We study the slopes of $U_p$-eigenvalues on the subspace of modular forms that can be transferred to a definite quaternion algebra. We give a sharp lower bound of the corresponding Newton polygon. The computation…

In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.

We prove $L^p\times L^q\rightarrow L^r$ bounds for certain lacunary bilinear maximal averaging operators with parameters satisfying the H\"older relation $1/p+1/q=1/r$. The boundedness region that we get contains at least the interior of…

We introduce the centred and the uncentred triangular maximal operators $\mathcal T$ and $\mathcal U$, respectively, on any locally finite tree in which each vertex has at least three neighbours. We prove that both $\mathcal T$ and…

We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

We put into evidence graphs with adjacency operator whose singular subspace is prescribed by the kernel of an auxiliary operator. In particular, for a family of graphs called admissible, the singular continuous spectrum is absent and there…