English
Related papers

Related papers: Uniform Lower Bound for Intersection Numbers of $\…

200 papers

We define a collection $\Theta_{g,n}\in H^{4g-4+2n}(\overline{\cal M}_{g,n},\mathbb{Q})$ for $2g-2+n>0$ of cohomology classes that restrict naturally to boundary divisors. We prove that the intersection numbers $\int_{\overline{\cal…

Algebraic Geometry · Mathematics 2023-09-27 Paul Norbury

Let $G$ be an intersection graph of $n$ geometric objects in the plane. We show that a maximum matching in $G$ can be found in $O(\rho^{3\omega/2}n^{\omega/2})$ time with high probability, where $\rho$ is the density of the geometric…

Computational Geometry · Computer Science 2024-05-02 Édouard Bonnet , Sergio Cabello , Wolfgang Mulzer

We study homogenization of a boundary obstacle problem on $ C^{1,\alpha} $ domain $D$ for some elliptic equations with uniformly elliptic coefficient matrices $\gamma$. For any $ \epsilon\in\mathbb{R}_+$, $\partial D=\Gamma \cup \Sigma$,…

Analysis of PDEs · Mathematics 2021-04-15 Jingzhi Li , Hongyu Liu , Lan Tang , Jiangwen Wang

The approximation properties of the trigonometric sums U_{n,p}^\psi of a special type are investigated on the classes C^\psi_{\beta, \infty} of (\psi,\beta)-differentiable (in the sense of Stepanets) periodical functions. The solution of…

Classical Analysis and ODEs · Mathematics 2012-12-18 A. S. Serdyuk , Ie. Yu. Ovsii

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

Combinatorics · Mathematics 2012-05-22 Liviu Ilinca , Jeff Kahn

We find asymptotic equalities for exact upper bounds of approximations by Fourier sums in uniform metric on classes of $2\pi$-periodic functions, representable in the form of convolutions of functions $\varphi$, which belong to unit balls…

Classical Analysis and ODEs · Mathematics 2016-03-08 A. S. Serdyuk , T. A. Stepaniuk

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

Number Theory · Mathematics 2022-01-14 Michael Björklund , Alexander Gorodnik

Here we study what we call bounded rough Riemannian metrics $(M,g)$, which are positive definite, symmetric tensors on each tangent space, $T_pM$, which are bounded and measurable as functions in coordinates. This is enough structure to…

Differential Geometry · Mathematics 2026-03-09 Brian Allen , Bernardo Falcao , Harry Pacheco , Bryan Sanchez

Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…

Combinatorics · Mathematics 2016-02-23 Nicolau C. Saldanha , Márcio Telles

We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…

Data Structures and Algorithms · Computer Science 2010-11-10 Jean Cardinal , Marek Karpinski , Richard Schmied , Claus Viehmann

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…

alg-geom · Mathematics 2008-02-03 Piotr Pragacz

We study the Hausdorff measure and dimension of the set of intrinsically simultaneously $\psi$-approximable points on a curve, surface, etc., given as a graph of integer valued polynomials. We obtain complete answers to these questions for…

Number Theory · Mathematics 2019-02-20 Morten Hein Tiljeset

Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…

Combinatorics · Mathematics 2025-05-28 Pu Gao , Yuval Ohapkin

$ \newcommand{\cardin}[1]{\left| {#1} \right|}% \newcommand{\Graph}{\Mh{\mathsf{G}}}% \providecommand{\G}{\Graph}% \renewcommand{\G}{\Graph}% \providecommand{\GA}{\Mh{H}}% \renewcommand{\GA}{\Mh{H}}% \newcommand{\VV}{\Mh{\mathsf{V}}}%…

Computational Geometry · Computer Science 2024-05-29 Sariel Har-Peled , Rahul Saladi

An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line…

Combinatorics · Mathematics 2017-07-18 Martin Balko , Josef Cibulka , Pavel Valtr

We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, and (iii) a certain random variable on the…

Combinatorics · Mathematics 2022-01-04 Jaehoon Kim , Hong Liu , Tuan Tran

An obstacle representation of a graph $G$ consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of $G$ to points such that two vertices are adjacent in $G$ if and only if the line…

Computational Geometry · Computer Science 2025-02-25 Martin Balko , Steven Chaplick , Robert Ganian , Siddharth Gupta , Michael Hoffmann , Pavel Valtr , Alexander Wolff

The paper concerns the uniform polynomial approximation of a function $f$, continuous on the unit Euclidean sphere of ${\mathbb R}^3$ and known only at a finite number of points that are somehow uniformly distributed on the sphere. First we…

Numerical Analysis · Mathematics 2018-08-10 Woula Themistoclakis , Marc Van Barel

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Functional Analysis · Mathematics 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto
‹ Prev 1 4 5 6 7 8 10 Next ›