相关论文: Soft edge results for longest increasing paths on …

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…

For an angle $\alpha\in (0,\pi)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $\alpha$ between the two edge segments, or (ii) circular arcs of central angle $2(\pi-\alpha)$. We…

We investigate the sharp endpoint extension inequality for the moment curve in finite fields. We determine the optimal constant and characterize the maximizers in two complementary regimes: (i) low dimensions $d\leq 20$; (ii) large field…

Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…

Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…

We settle a problem of Dujmovi\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using…

Surface growth models may give rise to unstable growth with mound formation whose tipical linear size L increases in time. In one dimensional systems coarsening is generally driven by an attractive interaction between domain walls or kinks.…

This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on…

We propose a detailed study of a canonical bound which relates the numbers of rational points of a curve over a finite field with that over its quadratic extension. Alternative proofs which make a connection with the variance enable to…

We study the Hardy inequality when the singularity is placed on the boundary of a bounded domain in $\mathbb{R}^n$ that satisfies both an interior and exterior ball condition at the singularity. We obtain the sharp Hardy constant $n^2/4$ in…

Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While $st$-orderings do extend to directed graphs, especially…

We address the scaling limits of random curves arising from, e.g., planar lattice models, especially in rough domains. The well-known precompactness conditions of Kemppainen and Smirnov show that certain crossing probability estimates…

An edge-ordering of a graph $G=(V,E)$ is a bijection $\phi:E\to\{1,2,...,|E|\}$. Given an edge-ordering, a sequence of edges $P=e_1,e_2,...,e_k$ is an increasing path if it is a path in $G$ which satisfies $\phi(e_i)<\phi(e_j)$ for all…

We introduce a two parameter ($\alpha, \beta>-1$) family of interacting particle systems with determinantal correlation kernels expressible in terms of Jacobi polynomials $\{ P^{(\alpha, \beta)}_k \}_{k \geq 0}$. The family includes…

We study the NP-hard Shortest Path Most Vital Edges problem arising in the context of analyzing network robustness. For an undirected graph with positive integer edge lengths and two designated vertices $s$ and $t$, the goal is to delete as…

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…

We consider a family of growth models defined using conformal maps in which the local growth rate is determined by $|\Phi_n'|^{-\eta}$, where $\Phi_n$ is the aggregate map for $n$ particles. We establish a scaling limit result in which…

We establish a sharp geometric constant for the upper bound on the resonance counting function for surfaces with hyperbolic ends. An arbitrary metric is allowed within some compact core, and the ends may be of hyperbolic planar, funnel, or…