相关论文: A New Proof of the New Intersection Theorem

A brief review on the progress made in the study of Chern-Simons gauge theory since its relation to knot theory was discovered ten years ago is presented. Emphasis is made on the analysis of the perturbative study of the theory and its…

We present a thorough analysis of the Non Intersecting String (NIS) model and its exact solution. This is an integrable $q$-states vertex model describing configurations of non-intersecting polygons on the lattice. The exact eigenvalues of…

In this paper, we prove common fixed point results for a self-mappings satisfying an implicit function which is general enough to cover a multitude of known as well as unknown contractions. Our results modify, unify, extend and generalize…

In 1969 Kinnersley, using the NP formalism, found all the Petrov type D, Ricci flat, solutions to the Einstein's Field Equations. Yet, in doing so -as it seems- he neglected two fundamental identities (or constraints) on four NP variables…

Transformer models bring propelling advances in various NLP tasks, thus inducing lots of interpretability research on the learned representations of the models. However, we raise a fundamental question regarding the reliability of the…

The problem on the minimal number (with respect to deformation) of intersection points of two closed curves on a surface is solved. Following the Nielsen approach, we define classes of intersection points and essential classes of…

We survey the techniques used in our recent resolution of the Kadison-Singer problem and proof of existence of Ramanujan Graphs of every degree: mixed characteristic polynomials and the method of interlacing families of polynomials. To…

In this paper, for symplectic and split odd special orthogonal groups, we develop an account of theory on the intersection problem of local Arthur packets. Specifically, following Atobe's reformulation on M{\oe}glin's construction of local…

A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In…

In its simplest form the Decomposition Theorem asserts that the rational intersection cohomology of a complex projective variety occurs as a summand of the cohomology of any resolution. This deep theorem has found important applications in…

In this note, we prove a theorem covering Chartrand, Kaigars, and Lick's theorem in [Proc. Amer. Math. Soc. 32 (1972), 63-68]. As an application, we give a simpler proof of theorem proved by Mader [J. Graph Theory 65 (2010), 61-69. (Theorem…

Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…

In 1964, Erd\H{o}s, Hajnal and Moon introduced a saturation version of Tur\'an's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a $K_r$-free, $n$-vertex graph with the property that…

We first prove the Grinberg-Kazhdan formal arc theorem without any assumptions on the characteristic. This part of the article is equivalent to arXiv:math-AG/0203263. Then we try to clarify the geometric ideas behind the proof by…

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Bj\"orner's crosscut theorem and two…

This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.

Let $\mathcal T_n$ denote the set of all labelled spanning trees of $K_n$. A family $\mathcal F \subset \mathcal T_n$ is $t$-intersecting if for all $A, B \in \mathcal F$ the trees $A$ and $B$ share at least $t$ edges. In this paper, we…

In the seventies, Charles Stein revolutionized the way of proving the Central Limit Theorem by introducing a method that utilizes a characterization equation for Gaussian distribution. In the last 50 years, much research has been done to…

In their paper published in 1997, Richmond and Richmond classified metric spaces in which all triangles are degenerate. That result was later reproved by Dovgoshei and Dordovskii in the finite case and it was generalized to finite…