Related papers: Poincar\'e and plancherel-polya inequalities in ha…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
In this paper, we obtain some comparisons of the Dirichlet, Neumann and Laplacian eigenvalues on graphs. We also discuss their rigidities and some of their applications including some Lichnerowicz-type, Fiedler-type and Friedman-type…
We construct examples of nonnegative harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our method relies on…
We study the spectral theory of a class of piecewise centrosymmetric Jacobi operators defined on an associated family of substitution graphs. Given a finite centrosymmetric matrix viewed as a weight matrix on a finite directed path graph…
We establish Sobolev-Poincar\'e inequalities for piecewise $W^{1,p}$ functions over families of fairly general polytopic (thence also shape-regular simplicial and Cartesian) meshes in any dimension; amongst others, they cover the case of…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
We describe a new operator space structure on $L_p$ when $p$ is an even integer and compare it with the one introduced in our previous work using complex interpolation. For the new structure, the Khintchine inequalities and Burkholder's…
We prove generalizations of the Poincare and logarithmic Sobolev inequalities corresponding to the case of fractional derivatives in measure spaces with only a minimal amount of geometric structure. The class of such spaces includes (but is…
Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum…
In this paper, we explore the topic of graph learning from the perspective of the Irregularity-Aware Graph Fourier Transform, with the goal of learning the graph signal space inner product to better model data. We propose a novel method to…
This monograph develops the theory of Besov spaces for abelian group actions on semifinite von Neumann algebras and then proves Peller criteria for traceclass properties of associated Hankel operators. This allows to extend known index…
We investigate higher-order geometric $k$-splines for template matching on Lie groups. This is motivated by the need to apply diffeomorphic template matching to a series of images, e.g., in longitudinal studies of Computational Anatomy. Our…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
There have been researches on sufficient spectral conditions for Hamiltonian properties and path-coverable properties of graphs. Utilizing the Bondy-Chv\'atal closure, we provide a unified approach to study sufficient graph eigenvalue…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
We study one-dimensional functional inequalities of the type of Poincar\'e, logarithmic Sobolev and Wirtinger, with weight, for probability densities with polynomial tails. As main examples, we obtain sharp inequalities satisfied by inverse…
With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…
We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…