English
Related papers

Related papers: On generalized corners and matrix multiplication

200 papers

Given an $n$-vertex $m$-edge digraph $G = (V,E)$ and a set $S \subseteq V$, $|S| = n^{\sigma}$ (for some $0 < \sigma \le 1$) of designated sources, the $S \times V$-direachability problem is to compute for every $s \in S$, the set of all…

Data Structures and Algorithms · Computer Science 2024-01-15 Michael Elkin , Chhaya Trehan

In this note, we are interested in obtaining uniform upper bounds for the number of powerful numbers in short intervals $(x, x + y]$. We obtain unconditional upper bounds $O(\frac{y}{\log y})$ and $O(y^{11/12})$ for all powerful numbers and…

Number Theory · Mathematics 2022-07-20 Tsz Ho Chan

In this article, we study domains $\Omega \subset \mathbb{S}^2$ that support positive solutions of the overdetermined problem $$ \Delta u + f(u,|\nabla u|)=0 \quad \text{in } \Omega, $$ subject to the boundary conditions $u=0$ on…

Analysis of PDEs · Mathematics 2026-02-23 José M. Espinar , Diego A. Marín

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

In 2006, Marcus and Tardos proved that if $A^1,\dots,A^n$ are cyclic orders on some subsets of a set of $n$ symbols such that the common elements of any two distinct orders $A^i$ and $A^j$ appear in reversed cyclic order in $A^i$ and $A^j$,…

Combinatorics · Mathematics 2024-11-12 Barnabás Janzer , Oliver Janzer , Abhishek Methuku , Gábor Tardos

The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou, FOCS 2023], the new method introduces several new…

Data Structures and Algorithms · Computer Science 2023-11-07 Virginia Vassilevska Williams , Yinzhan Xu , Zixuan Xu , Renfei Zhou

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Metric Geometry · Mathematics 2017-03-09 Nóra Frankl , János Nagy , Márton Naszódi

We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is…

Combinatorics · Mathematics 2019-02-20 Micha Sharir , Adam Sheffer , Joshua Zahl

We show that a dense subset of a sufficiently large group multiplication table contains either a large part of the addition table of the integers modulo some $k$, or the entire multiplication table of a certain large abelian group, as a…

Combinatorics · Mathematics 2019-04-10 Jason Long

We construct skew corner-free sets in $[n]^2$ of size $n^{5/4}$, thereby disproving a conjecture of Kevin Pratt. We also show that any skew corner-free set in $\mathbb{F}_{q}^{n} \times \mathbb{F}_{q}^{n}$ must have size at most…

Combinatorics · Mathematics 2024-02-01 Cosmin Pohoata , Dmitrii Zakharov

Given an $n$-vertex $m$-edge digraph $G = (V,E)$ and a subset $S \subseteq V$ of $|S| = n^{\sigma}$ (for some $0 \le \sigma \le 1$) designated sources, the $S \times V$ reachability problem is to compute the sets $\mathcal V_s$ of vertices…

Data Structures and Algorithms · Computer Science 2026-05-12 Michael Elkin , Chhaya Trehan

We consider a question raised by Rudnev: given four pencils of $n$ concurrent lines in $\mathbb R^2$, with the four centres of the pencils non-collinear, what is the maximum possible size of the set of points where four lines meet? Our main…

Combinatorics · Mathematics 2018-05-24 Oliver Roche-Newton , Audie Warren

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

Consider a solution $f\in C^{2}(\Omega)$ of a prescribed mean curvature equation \[ {\rm div}\left(\frac{\nabla f}{\sqrt{1+|\nabla f|^{2}}}\right)=2H(x,f) \ \ \ \ {\rm in} \ \ \Omega\subset R^{2}, \] where $\Omega$ is a domain whose…

Analysis of PDEs · Mathematics 2017-04-19 Mozhgan , Entekhabi , Kirk Lancaster

In 2007, Y. Shimoda, in connection with a long-standing question of J. Sally, asked whether a Noetherian local ring, such that all its prime ideals different from the maximal ideal are complete intersections, has Krull dimension at most…

Commutative Algebra · Mathematics 2015-01-14 Shiro Goto , Liam O'Carroll , Francesc Planas-Vilanova

We prove two upper bounds for the Steklov eigenvalues of a compact Riemannian manifold with boundary. The first involves the volume of the manifold and of its boundary, as well as packing and volume growth constants of the boundary and its…

Spectral Theory · Mathematics 2023-08-22 Bruno Colbois , Alexandre Girouard

In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form $$ \kappa({\mathcal U}) \le…

Classical Analysis and ODEs · Mathematics 2019-03-12 Raf Cluckers , Omer Friedland , Yosef Yomdin

In this paper we construct nontrivial exterior domains $\Omega \subset \mathbb{R}^N$, for all $N\geq 2$, such that the problem $$\left\{ {ll} -\Delta u +u -u^p=0,\ u >0 & \mbox{in }\; \Omega, {1mm] \ u= 0 & \mbox{on }\; \partial \Omega,…

Analysis of PDEs · Mathematics 2016-09-14 Antonio Ros , David Ruiz , Pieralberto Sicbaldi

Let $(M^n,g)$ be a complete simply connected $n$-dimensional Riemannian manifold with curvature bounds $\operatorname{Sect}_g\leq \kappa$ for $\kappa\leq 0$ and $\operatorname{Ric}_g\geq(n-1)Kg$ for $K\leq 0$. We prove that for any bounded…

Differential Geometry · Mathematics 2020-03-09 Xiaolong Li , Kui Wang , Haotian Wu

For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction,…

Combinatorics · Mathematics 2011-02-28 Bernardo M. Ábrego , Silvia Fernández-Merchant
‹ Prev 1 4 5 6 7 8 10 Next ›