Related papers: Graphical proof of Ginibre's inequality

We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…

The notion of completely positive invariant conjugate-bilinear map in a partial *-algebra is introduced and a generalized Stinespring theorem is proven. Applications to the existence of integrable extensions of *-representations of…

In recent years, there has been a growing interest in using learning-based approaches for solving combinatorial problems, either in an end-to-end manner or in conjunction with traditional optimization algorithms. In both scenarios, the…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

We use classical invariant theory to construct invariants of complex graded Gorenstein algebras of finite vector space dimension. As a consequence, we obtain a way of extracting certain numerical invariants of quasi-homogeneous isolated…

The connections amongst (1) quivers whose representation varieties are Calabi-Yau, (2) the combinatorics of bipartite graphs on Riemann surfaces, and (3) the geometry of mirror symmetry have engendered a rich subject at whose heart is the…

We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach (in the sense of ludics) related to game…

This is the second installment in a series of papers aimed at generalizing symplectic capacities and homologies. We study symmetric versions of symplectic capacities for real symplectic manifolds, and obtain corresponding results for them…

Concentration results and probabilistic analysis for combinatorial problems like the TSP, MWST, graph coloring have received much attention, but generally, for i.i.d. samples (i.i.d. points in the unit square for the TSP, for example).…

The hyperbolic Ax-Lindemann-Weierstrass conjecture is a functional algebraic independence statement for the uniformizing map of an arithmetic variety. In this paper we provide a proof of this conjecture, generalizing previous work of…

We obtain new variants of weighted Gagliardo-Nirenberg interpolation inequalities in Orlicz spaces, as a consequence of weighted Hardy-type inequalities. The weights we consider need not be doubling.

We develop a method to calculate left-right eigenvector correlations of the product of $m$ independent $N\times N$ complex Ginibre matrices. For illustration, we present explicit analytical results for the vector overlap for a couple of…

In this paper, we establish a condition on weighted graphs with finite measure that guarantees the validity of a global Poincar\'e inequality. This condition can be viewed as a discrete analogue of the criterion introduced by J. Boman in…

We compare the Ornstein-Uhlenbeck process for the Gaussian Unitary Ensemble to its non-hermitian counterpart - for the complex Ginibre ensemble. We exploit the mathematical framework based on the generalized Green's functions, which…

We prove a version of the Hilbert basis theorem in the setting of equivariant algebraic geometry: given a group G acting on a finite type morphism of schemes X -> S, if S is topologically G-noetherian, then so is X.

We give an explicit combinatorial Chevalley-type formula for the equivariant K-theory of generalized flag varieties G/P which is a direct generalization of the classical Chevalley formula. Our formula implies a simple combinatorial model…

We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…

Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…

In this paper we study a family of interpolation Gagliardo-Nirenberg-Sololev inequalities on planar graphs. We are interested in knowing when the best constants in the inequalities are achieved. We also analyse the set of solutions of the…