相关论文: Sur l'alg\'ebrisation des tissus, le th\'eor\`eme …

We give the classification of 3-dimensional Bol algebras associated to the trilinears operations $(e_2,e_3, e_2)=e_1, (e_2, e_3, e_3)=\pme_2$. It turn that for such trilinears operation there exist up to isomorphism and isotopy one family…

Let $X$ be an arbitrary smooth hypersurface in $\mathbb{C} \mathbb{P}^n$ of degree $d$. We prove the de Jong-Debarre Conjecture for $n \geq 2d-4$: the space of lines in $X$ has dimension $2n-d-3$. We also prove an analogous result for…

In this paper we study the linearizability problem for 3-webs on a 2-dimensional manifold. With an explicit computation based on the theory developed in the paper "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.…

In a previous paper, we studied the web by conics $\boldsymbol{\mathcal W}_{{\rm dP}_4}$ on a del Pezzo quartic surface ${\rm dP}_4$ and proved that it enjoys suitable versions of most of the remarkable properties satisfied by Bol's web…

A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…

Consider a very general abelian variety $A$ of dimension at least $3$ and an integer $0<d\leq \dim A$. We show that if the map $A^k\to CH_0(A)$ has a $d$-dimensional fiber then $k\geq d+(\dim A+1)/2$. This extends results of the…

Let $\ell$ be a rational prime. We show that an analogue of a conjecture of Greenberg in graph theory holds true. More precisely, we show that when $n$ is sufficiently large, the $\ell$-adic valuation of the number of spanning trees at the…

Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in…

We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…

We propose a relation between the brane configurations consisting of D3-branes and 5-brane webs which realize 3d $\mathcal{N}=2$ supersymmetric Chern-Simons theories and quantum curves by focusing on the $S^{3}$ partition functions. In…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

Fix an integer $s \ge 2$. Let $\mathcal{P}$ be a set of $n$ points and let $\mathcal{L}$ be a set of lines in a linear space such that no line in $\mathcal{L}$ contains more than $(n-1)/(s-1)$ points of $\mathcal{P}$. Suppose that for every…

We study the dg-Lie algebra f_n generated by the coefficients of the universal translation invariant flat dg-connection on the n-dimensional affine space. We describe its "semiabelianization" (in particular, the universal quotient which is…

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

A. Weil identified a 2-dimensional space of rational classes of Hodge type (n,n) in the middle cohomology of every 2n-dimensional abelian variety with a suitable complex multiplication by an imaginary quadratic number field. These abelian…

Let $E_{d}(\ell)$ denote the space of all closed $n$-gons in $\R^{d}$ (where $d\ge 2$) with sides of length $\ell_1,..., \ell_n$, viewed up to translations. The spaces $E_d(\ell)$ are parameterized by their length vectors $\ell=(\ell_1,...,…

Pick a sequence of uniform points on the $d$-dimensional sphere. Then, link the $n$th point to its closest one that arrives in the past. This constructs a labelled tree called the nearest neighbour tree on the $d$-dimensional sphere. These…

We consider the geometric join of a family of subsets of the Euclidean space. This is a construction frequently used in the (colorful) Carath\'eodory and Tverberg theorems, and their relatives. We conjecture that when the family has at…

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=\sum_{i=1}^n d(G,i) x^i$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. The $n$-barbell graph $Bar_n$ with $2n$…

This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum the algebraic connectivity among all graphs of order $n$…