Related papers: Sur l'alg\'ebrisation des tissus, le th\'eor\`eme …

The Alon-Boppana theorem confirms that for every $\epsilon>0$ and every integer $d\ge3$, there are only finitely many $d$-regular graphs whose second largest eigenvalue is at most $2\sqrt{d-1}-\epsilon$. Serre gave a strengthening showing…

Soft gluon exponentiation in non-abelian gauge theories can be described in terms of webs. So far this description has been restricted to amplitudes with two hard partons, where webs were defined as the colour-connected subset of diagrams.…

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

A T-net of order $m$ is a graph with $m$ nodes and $2m$ directed edges, where every node has indegree and outdegree equal to $2$. (A well known example of T-nets are de Bruijn graphs.) Given a T-net $N$ of order $m$, there is the so called…

We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with particular emphasis on the set D' comprised of differences between successive…

We show that for n>2 the following equivalence problems are essentially the same: the equivalence problem for Lagrangians of order n with one dependent and one independent variable considered up to a contact transformation, a multiplication…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

Let S be a smooth irreducible curve defined over a number field k and consider an abelian scheme A over S and a curve C inside A, both defined over k. In previous works, we proved that when A is a fibered product of elliptic schemes, if C…

The aim of this work is to study the foliations on the complex projective plane with flat \textsc{Legendre} transform (dual web). We establish some effective criteria for the flatness of the dual $d$-web of a homogeneous foliation of degree…

We prove that for each $n \geq 2$, there exists a ruled variety X of dimension n such that Bir(X) contains connected algebraic subgroups which are not lying in a maximal one.

We show that a sufficiently general hypersurface of degree $d$ in $n$-dimensional projective space admits a toric Gr\"obner degeneration if and only if $d\leq 2n-1$.

The language of graph theory, or network science, has proven to be an exceptional tool for addressing myriad problems in neuroscience. Yet, the use of networks is predicated on a critical simplifying assumption: that the quintessential unit…

Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…

Given a hypergraph $H=(V,E)$, define for every edge $e\in E$ a linear expression with arguments corresponding with the vertices. Next, let the polynomial $p_H$ be the product of such linear expressions for all edges. Our main goal was to…

We discuss 3d brane webs and effective Chern-Simons levels for 3d $\mathcal{N}=2$ gauge theories. We find that turning on real masses for chiral multiplets leads to various equivalent brane webs that are related by flipping positions of…

We study the problem of embedding bipartite graphs in Ahlfors-David regular sets of large dimension using results from extremal graph theory. Our main theorem states that any graph satisfying a power-improving bound on the extremal number…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…