Related papers: Concentration estimates for algebraic intersection…
This paper establishes pointwise estimates up to boundary for the gradient of weak solutions to a class of very singular quasilinear elliptic equations with mixed data: \begin{cases} -\operatorname{div}(A(x,D u))=g-\operatorname{div} f…
We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…
We investigate to what extent the degree sequence of a directed network constrains the number of driver nodes. We develop a pair of algorithms that take a directed degree sequence as input and aim to output a network with the maximum or…
We study the cluster categories arising from marked surfaces (with punctures and non-empty boundaries). By constructing skewed-gentle algebras, we show that there is a bijection between tagged curves and string objects. Applications include…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
In this paper, optimal control problems governed by diffusion equations with Dirichlet and Neumann boundary conditions are investigated in the framework of the gradient discretisation method. Gradient schemes are defined for the optimality…
This paper describes a method for solving smooth nonconvex minimization problems subject to bound constraints with good worst-case complexity guarantees and practical performance. The method contains elements of two existing methods: the…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…
Primary vertex finding for collider experiments is studied. The efficiency and precision of finding interaction vertices can be improved by advanced clustering and classification methods, such as agglomerative clustering with fast pairwise…
We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understanding of clustering…
We investigate how the concepts of intersection and sums of subobjects carry to exact categories. We obtain a new characterisation of quasi-abelian categories in terms of admitting admissible intersections in the sense of Hassoun and Roy.…
The bivariate distribution of degrees of adjacent vertices (degree-degree distribution) is an important network characteristic defining the statistical dependencies between degrees of adjacent vertices. We show the asymptotic degree-degree…
Let $X$ be a real algebraic variety with set of complex points $X_{\mathbb C}$ and set of real points $X_{\mathbb R}$. A complex slice of $X$ is a transverse intersection of $X_{\mathbb R}$ with a complex subvariety $V$ of $X_{\mathbb C}$.…
We produce a family of reductions for Schubert intersection problems whose applicability is checked by calculating a linear combination of the dimensions involved. These reductions do not alter the Littlewood-Richardson coefficient, and…
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1)…
We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…
In this paper, we classify the possible group structures on the set of $R$-valued points of an abelian variety, where $R$ is any real closed field. We make use of a family of abelian varieties that, in effect, allows one to quantify over…
Let $Z$ be an algebraic subvariety of a Shimura variety. We extend results of the first author to prove an effective upper bound for the degree of a non-facteur maximal special subvariety of $Z$.
Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…