Related papers: Maximum rank of a Legendrian web
In this paper, we prove new relations between the bias of multilinear forms, the correlation between multilinear forms and lower degree polynomials, and the rank of tensors over $GF(2)= \{0,1\}$. We show the following results for…
Bounding the number of rational points of height at most $H$ on irreducible algebraic plane curves of degree $d$ has been an intense topic of investigation since the work by Bombieri and Pila. In this paper we establish optimal dependence…
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…
We classify, up to projective automorphism, all homogeneous pre-foliations of co-degree one and degree four on the complex projective plane $\Ptwo$ whose Legendre transform defines a flat $4$-web. The classification is organized according…
We give an $h$--principle type result for a class of Legendrian embeddings in contact manifolds of dimension at least $5$. These Legendrians, referred to as loose, have trivial pseudo-holomorphic invariants. We demonstrate they are…
We determine the homotopy type of the spaces of several Legendrian knots and links with the maximal Thurston--Bennequin invariant. In particular, we give a recursive formula of the homotopy type of the space of Legendrian embeddings of…
Given integers $d\ge 3$ and $N\ge 3$. Let $G$ be a finite abelian group acting faithfully and linearly on a smooth hypersurface of degree $d$ in the complex projective space $\mathbb{P}^{N-1}$. Suppose $G\subset PGL(N, \mathbb{C})$ can be…
The conormal lift of a link $K$ in $\R^3$ is a Legendrian submanifold $\Lambda_K$ in the unit cotangent bundle $U^* \R^3$ of $\R^3$ with contact structure equal to the kernel of the Liouville form. Knot contact homology, a topological link…
We exploit the critical locus structure on the Quot scheme $\mathrm{Quot}_{\mathbb A^3}(\mathscr O^{\oplus r},n)$, in particular the associated symmetric obstruction theory, in order to define rank $r$ K-theoretic Donaldson-Thomas…
We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over…
We give a classification of Legendrian torus links. Along the way, we give the first classification of infinite families of Legendrian links where some smooth symmetries of the link cannot be realized by Legendrian isotopies. We also give…
In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two categorical Legendrian isotopy invariants: the augmentation category, a unital $A_{\infty}$-category, which lifts the set of…
We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…
Motivated by Internet targeted advertising, we address several ad allocation problems. Prior work has established these problems admit no randomized online algorithm better than $(1-\frac{1}{e})$-competitive…
In this paper, motivated by a problem posed by Barry Mazur, we show that for smooth projective varieties over the rationals, the odd cohomology groups of degree less than or equal to the dimension can be modeled by the cohomology of an…
Place-cell networks, typically forced to pairwise synaptic interactions, are widely studied as models of cognitive maps: such models, however, share a severely limited storage capacity, scaling linearly with network size and with a very…
It is known from the algebraic graph theory that if $L$ is the Laplacian matrix of some tree $G$ with a vertex degree sequence $\mathbf{d}=(d_1, ..., d_n)^\top$ and $D$ is its distance matrix, then…
Max-linear Bayesian networks are recursive max-linear structural equation models represented by an edge weighted directed acyclic graph (DAG). The identifiability and estimation of max-linear Bayesian networks is an intricate issue as…
The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a…
We prove that there are at least seeds many exact embedded Lagrangian fillings for Legendrian links of type $\mathsf{ADE}$. We also provide seeds many Lagrangian fillings with certain symmetries for type $\mathsf{BCFG}$. Our main tools are…