Related papers: Th\'eor\`eme de Gabber d'ind\'ependance de $l$
This chapter of the forthcoming Handbook of Graphical Models contains an overview of basic theorems and techniques from algebraic geometry and how they can be applied to the study of conditional independence and graphical models. It also…
We prove the existence of a sequence of commutative diagrams generalizing existing results on the cohomology of the Borel-Serre boundary and well-rounded retract to the context of the well-tempered complex. Our main theorem provides a…
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.
We determine the independence number of the orthogonality graph on $2^k$-dimensional hypercubes. This answers a question by Galliard from 2001 which is motivated by a problem in quantum information theory. Our method is a modification of a…
Gabber's Theorem claims that the singular support of a D-module is involutive. We show how to give a conceptually clear proof of this in the context of Hochschild Homology and Cohomology of abelian categories.
We show that if $G$ is an infinitesimal elementary supergroup scheme of height $\leq r$, then the cohomological spectrum $|G|$ of $G$ is naturally homeomorphic to the variety $\mathcal{N}_r(G)$ of supergroup homomorphisms $\rho:…
A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…
Testing for independence between graphs is a problem that arises naturally in social network analysis and neuroscience. In this paper, we address independence testing for inhomogeneous Erd\H{o}s-R\'{e}nyi random graphs on the same vertex…
This paper formulates a notion of independence of subobjects of an object in a general (i.e. not necessarily concrete) category. Subobject independence is the categorial generalization of what is known as subsystem independence in the…
In the restricted setting of product phase space lattices, we give an alternate proof of P. Linnell's theorem on the finite linear independence of lattice Gabor systems in $L^2(\mathbb R^d)$. Our proof is based on a simple argument from the…
We present several approaches to equivariant intersection cohomology. We show that for a complete algebraic variety acted by a connected algebraic group $G$ it is a free module over $H^*(BG)$. The result follows from the decomposition…
We consider several conjectures on the independence of $\ell$ of the \'etale cohomology of (singular, open) varieties over $\bar{\mathbf F}_p$. The main result is that independence of $\ell$ of the Betti numbers $h^i_{\text{c}}(X,\mathbf…
Within its traditional range of perversity parameters, intersection cohomology is a topological invariant of pseudomanifolds. This is no longer true once one allows superperversities, in which case intersection cohomology may depend on the…
Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…
We provide a necessary and sufficient condition for the derived self-intersection of a smooth subscheme inside a smooth scheme to be a fibration over the subscheme. As a consequence we deduce a generalized HKR isomorphism. We also…
Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…
A well known upper bound for the independence number $\alpha(G)$ of a graph $G$, due to Cvetkovi\'{c}, is that \begin{equation*} \alpha(G) \le n^0 + \min\{n^+ , n^-\} \end{equation*} where $(n^+, n^0, n^-)$ is the inertia of $G$. We prove…
For a connected subcubic graph $G\neq K_1$ let $V_i(G) = \{v \in V(G) ~|~ d_G(v)=i\}$ for $1 \leq i \leq 3.$ Given $c_1, c_2, c_ 3 \in \mathbb{R}^+$ and $ d \in \mathbb{R}$, we show several results of type $\alpha(G) \geq c_1|V_1(G)| +…
The deformations of an infinite dimensional algebra may be controlled not just by its own cohomology but by that of an associated diagram of algebras, since an infinite dimensional algebra may be absolutely rigid in the classical…
The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…