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

Using class field theory, we prove a restriction on the intersection of the maximal abelian extensions associated with different number fields. This restriction is then used to improve a result of Rosen and Silverman about the linear…

We give short expositions of both Leighton's proof and the Bass-Kulkarni proof of Leighton's graph covering theorem, in the context of colored graphs. We discuss a further generalization, needed elsewhere, to "symmetry-restricted graphs."…

At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graphs not containing H as a minor. Robertson and Seymour prove…

We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…

Resolving a conjecture of F\"uredi from 1988, we prove that with high probability, the random graph $G(n,1/2)$ admits a friendly bisection of its vertex set, i.e., a partition of its vertex set into two parts whose sizes differ by at most…

A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be cross-intersecting if each set in $\mathcal{A}$ intersects each set in…

The aim of this note is to point out that Chern characters can be computed using curvatures o ``super-connections up to homotopy'. We also present an application to the vanishing theorem for Lie algebroids which is at the origin of new…

We consider the construction of refined Chern-Simons torus knot invariants by M. Aganagic and S. Shakirov from the DAHA viewpoint of I. Cherednik. We give a proof of Cherednik's conjecture on the stabilization of superpolynomials, and then…

George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…

For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…

In this paper, we introduce the concept of mixed (G, S)-monotone mappings and prove coupled coincidence and coupled common fixed point theorems for such mappings satisfying a nonlinear contraction involving altering distance functions.…

Let $f: Y\to X$ be a morphism between smooth complex quasi-projective varieties and $Z$ be the closure of $f(Y)$ with $\iota: Z\to X$ the inclusion map. We prove that a. for any field $K$, there exist finitely many semisimple…

A family of permutations $A \subset S_n$ is said to be \emph{$t$-set-intersecting} if for any two permutations $\sigma, \pi \in A$, there exists a $t$-set $x$ whose image is the same under both permutations, i.e. $\sigma(x)=\pi(x)$. We…

An explicit quantization of Chern-Simons theory leads to an identity between sums of the Kac-Weyl characters. One can use this identity to prove inequalities that constrain the fusion coefficients $N_{\mu\nu}^l$ in the case of RCFTs that…

The study of regularity and complete intersection of a tensor product of commutative algebras possessing the same property started with Grothendieck in 1965 and has continued until today. Surprisingly, the homology theory of Andre and…

The purpose of this note is to present in details R codes to implement a non-parametric method for change-point detection. The proposed approach is validated from various perspectives using simulations. This method is a competitor to that…

Recently Guth and Katz \cite{GK2} invented, as a step in their nearly complete solution of Erd\H{o}s's distinct distances problem, a new method for partitioning finite point sets in $\R^d$, based on the Stone--Tukey polynomial ham-sandwich…

We provide a proof of the union-closed sets conjecture, by means of a suitable refinement of the breakthrough entropy-approach introduced by Gilmer. The novelty here is to consider a convex combination of $A$ and $A\cup B$, where $A,B$ are…

We explain how a simple twisting of the notion of spectral triple allows to incorporate type III examples, such as those arising from the transverse geometry of codimension one foliations. Since the twisting of the commutators turns the…

We study configurations of $n$ points and $n$ lines that form $\Theta(n^{4/3})$ incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel…