相关论文: A Viro Theorem without convexity hypothesis for tr…

Computing the isotopy type of a hypersurface, defined as the positive real zero set of a multivariate polynomial, is a challenging problem in real algebraic geometry. We focus on the case where the defining polynomial has combinatorially…

It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…

We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…

We study rational curves on general Fano hypersurfaces in projective space, mostly by degenerating the hypersurface along with its ambient projective space to reducible varieties. We prove results on existence of low-degree rational curves…

In this paper, we give a necessary condition for a diagram to represent the trivial knot.

We review a certain problem on covering triangles in the plane. Equivalently, it can be viewed as a family of 'isobilliard' inequalities in convex shapes, and as a special case of Viterbo's conjecture in symplectic geometry. We give an…

A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…

Consider a simple algebraic group G of adjoint type, and its wonderful compactification X. We show that X admits a unique family of minimal rational curves, and we explicitly describe the subfamily consisting of curves through a general…

In this paper, we prove the ampleness conjecture and Serrano's conjecture for strictly nef divisors on K-trivial fourfolds. Specifically, we show that any strictly nef divisors on projective fourfolds with trivial canonical bundle and…

We revisit sequentialization proofs associated with the Danos-Regnier correctness criterion in the theory of proof nets of linear logic. Our approach relies on a generalization of Yeo's theorem for graphs, based on colorings of half-edges.…

We study different notions of slope of a vector bundle over a smooth projective curve with respect to ampleness and affineness in order to apply this to tight closure problems. This method gives new degree estimates from above and from…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

The conjecture of Beineke and Harary states that for any two vertices which can be separated by $k$ vertices and $l$ edges for $l\geq 1$ but neither by $k$ vertices and $l-1$ edges nor $k-1$ vertices and $l$ edges there are $k+l$…

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

In this paper, we discuss some problems of elementary plane differential geometry and kinematics. Although the results are not new, the consistent use of complex-valued functions (plane curves) of a real variable (parameter) allows to…

Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the Erd\H{o}s--Szekeres theorem is known and empty triangles have been investigated. We introduce a…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

The Separatrix Theorem of C. Camacho and P. Sad guarantees the existence of invariant curve (separatrix) passing through the singularity of germ of holomorphic foliation on complex surface, when the surface underlying the foliation is…

As a strengthening of Hadwiger's conjecture, Gerards and Seymour conjectured that every graph with no odd $K_t$ minor is $(t-1)$-colorable. We prove two weaker variants of this conjecture. Firstly, we show that for each $t \geq 2$, every…

A famous conjecture of Tuza \cite{tuza} is that the minimal number of edges needed to cover all triangles in a graph is at most twice the maximal number of edge-disjoint triangles. We propose a wider setting for this conjecture. For a…