Related papers: Poincar\'e and plancherel-polya inequalities in ha…
Signed graphs are equipped with both positive and negative edge weights, encoding pairwise correlations as well as anti-correlations in data. A balanced signed graph has no cycles of odd number of negative edges. Laplacian of a balanced…
We study Hardy inequalities for $p$-Schr\"odinger operators on general weighted graphs. Specifically, we prove a Maz'ya-type result, where we characterize the space of Hardy weights for $ p $-Schr\"odinger operators via a generalized…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
We establish frame inequalities for signals in Paley--Wiener spaces on two specific families of graphs consisting of combinations of cubes and cycles. The frame elements are localizations to cubes, regarded as clusters in the graphs, of…
We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…
We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering…
In this paper we address the problem of estimating the operator norm of the embeddings between multidimensional weighted Paley-Wiener spaces. These can be equivalently thought as Fourier uncertainty principles for bandlimited functions. By…
We introduce the discrete poly-Laplace operator on a subgraph with Dirichlet boundary condition. We obtain upper and lower bounds for the sum of the first $k$ Dirichlet eigenvalues of the poly-Laplace operators on a finite subgraph of…
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…
By differentiating a concavity principle arising from the Pr\'ekopa-Leindler inequality, we obtain a statement simultaneously strengthening the weighted boundary Poincar\'e inequality and the Brascamp-Lieb variance inequality. The resulting…
In this paper, we obtain sharp remainder terms for the Hardy-Poincar\'e inequalities with general non-radial weights in the setting of Baouendi-Grushin vector fields (see Theorem 2.5). It is worth emphasizing that all of our results are new…
Let $G$ be a countable discrete group with an orthogonal representation $\alpha$ on a real Hilbert space $H$. We prove $L_p$ Poincar\'e inequalities for the group measure space $L_\infty(\Omega_H,\gamma)\rtimes G$, where both the group…
We prove Poincar\'e and Sobolev inequalities in matrix A${}_p$ weighted spaces. We then use these Poincar\'e inequalities to prove existence and regularity results for degenerate systems of elliptic equations whose degeneracy is governed by…
A unified framework for the Expander Mixing Lemma for irregular graphs using adjacency eigenvalues is presented, as well as two new versions of it. While the existing Expander Mixing Lemmas for irregular graphs make use of the notion of…
Let $(W,S,L)$ be a weighted Coxeter system and $J$ a subset of $S$, Yin [12] introduced the weighted $W$-graph ideal $E_J$ and the weighted Kazhdan-Lusztig polynomials $ \left \{ P_{x,y} \mid x,y\in E_J\right \}$. In this paper, we study…
In this paper we investigate the physical spectrum of the gravitational theory based on the Poincar\'e group with terms which are at most quadratic in tetrad and spin connection, allowing for the presence of parity-even as well as…
We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…
We propose a method based on the combination of theoretical results on Blaschke--Santal\'o diagrams and numerical shape optimization techniques to obtain improved description of Blaschke--Santal\'o diagrams in the class of planar convex…
Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are…
We introduce a novel numerical framework for the exploration of Blaschke--Santal\'o diagrams, which are efficient tools characterizing the possible inequalities relating some given shape functionals. We introduce a parametrization of convex…