Related papers: Concentration estimates for algebraic intersection…
An algebraic method for a general construction of intersecting p-brane solutions in diverse spacetime dimensions is discussed. An incidence matrix describing configurations of electric and magnetic fields is introduced. Intersecting…
We introduce descent methods to the study of strong approximation on algebraic varieties. We apply them to two classes of varieties defined by P(t)=N_{K/k}(z): firstly for quartic extensions of number fields K/k and quadratic polynomials…
In this paper we show how some known weak forms of the Zilber--Pink conjecture can be strengthened by combining them with the Mordell--Lang conjecture or its variants. We illustrate this idea by proving some theorems on atypical…
We study the Partial Degree Bounded Edge Packing (PDBEP) problem introduced in [5] by Zhang. They have shown that this problem is NP-Hard even for uniform degree constraint. They also presented approximation algorithms for the case when all…
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…
Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…
We study the field concentration phenomenon between two closely spaced perfect conductors with imperfect bonding interfaces of low conductivity type. The boundary condition on these interfaces is given by a Robin-type boundary condition. We…
We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…
The paper is a part of our program to build up a theory of couting immersed nodal curve on algebraic surfaces, as an enumerative Riemann-Roch theory (outlined in math.AG/0405113). In this paper, we discuss the excess intersection theory of…
Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…
We present a novel deep learning approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. These systems arise from many problems in applied science, e.g., in numerical methods for…
The purpose of this talk is to present an (apparently) new way to look at the intersection complex of a singular variety over a finite field, or, more generally, at the intermediate extension functor on pure perverse sheaves, and an…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
In this paper, we study the persistent homology of the offset filtration of algebraic varieties. We prove the algebraicity of two quantities central to the computation of persistent homology. Moreover, we connect persistent homology and…
In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…
We obtain a lower bound of the degree of irrationality of very general complete intersections over the complex field from the recent results of the first author and Chen--Stapleton. For combining these results, we make a minor adjustment of…
Extreme value statistics provides accurate estimates for the small occurrence probabilities of rare events. While theory and statistical tools for univariate extremes are well-developed, methods for high-dimensional and complex data sets…
This paper deals with bounding the error on the estimation of quantities of interest obtained by finite element and domain decomposition methods. The proposed bounds are written in order to separate the two errors involved in the resolution…