English
Related papers

Related papers: On large complete arcs: ood case

200 papers

We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…

Combinatorics · Mathematics 2019-02-25 Alexander E. Guterman , Dmitrii K. Kudryavtsev

We consider certain estimates involving averaging operators over curves and hypersurfaces that can be cast into a combinatorial framework. We show that hypersurfaces with nonzero rotational curvature satisfy the usual restricted weak-type…

Classical Analysis and ODEs · Mathematics 2007-05-23 W. Schlag

We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.

Number Theory · Mathematics 2018-10-03 Jean-Marc Deshouillers , Adrián Ubis

Given a finite morphism $\varphi:Y\to X$ of quasi-smooth Berkovich curves over a complete, algebraically closed field $k$ of characteristic $0$, we prove a Riemann-Hurwitz formula relating their Euler-Poincar\'e characteristics (calculated…

Algebraic Geometry · Mathematics 2017-03-07 Velibor Bojković

A complete classification and character formulas for finite-dimensional irreducible representations of the rational Cherednik algebra of type A is given. Less complete results for other types are obtained. Links to the geometry of affine…

Representation Theory · Mathematics 2007-05-23 Yuri Berest , Pavel Etingof , Victor Ginzburg

We use a global version of Heath-Brown's $p-$adic determinant method developed by Salberger to give upper bounds for the number of rational points of height at most $B$ on non-singular cubic curves defined over $\mathbb{Q}$. The bounds are…

Number Theory · Mathematics 2018-05-03 Manh Hung Tran

We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does…

Number Theory · Mathematics 2023-05-05 Brendan Creutz , Duttatrey Nath Srivastava

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

Combinatorics · Mathematics 2026-05-22 Jingjie Yang , Mikołaj Bojańczyk , Bartek Klin

Recently Wolff obtained a nearly sharp $L^2$ bilinear restriction theorem for bounded subsets of the cone in general dimension. We obtain the endpoint of Wolff's estimate and generalize to the case when one of the subsets is large. As a…

Classical Analysis and ODEs · Mathematics 2007-05-23 Terence Tao

In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…

Geometric Topology · Mathematics 2019-10-30 Meru Alagalingam

We apply a variant of the square-sieve to produce a uniform upper bound for the number of rational points of bounded height on a family of surfaces that admit a fibration over the projective line, whose general fibre is a hyperelliptic…

Number Theory · Mathematics 2021-09-28 Dante Bonolis , Tim Browning

We prove uniform upper bounds on the number of integral points of bounded height on affine varieties. If $X$ is an irreducible affine variety of degree $d\geq 4$ in $\mathbb{A}^n$ which is not the preimage of a curve under a linear map…

Number Theory · Mathematics 2024-04-26 Floris Vermeulen

In this paper, we develop the infinitesimal geometry of the limit spaces of compact Riemannian manifolds with boundary, where we assume lower bounds on the sectional curvatures of manifolds and boundaries and the second fundamental forms of…

Differential Geometry · Mathematics 2026-04-14 Takao Yamaguchi , Zhilang Zhang

We show upper bounds on the maximal dimension $d$ of Hilbert cubes $H=a_0+\{0,a_1\}+\cdots + \{0, a_d\}\subset S \cap [1, N]$ in several sets $S$ of arithmetic interest such as the squares, powerful numbers and pure powers.

Number Theory · Mathematics 2015-10-20 Rainer Dietmann , Christian Elsholtz

A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical…

Combinatorics · Mathematics 2026-04-14 Catherine Greenhill , Tamás Makai

We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Michael Joswig , Marc E. Pfetsch

In this paper, we will give a uniform upper bound of the number of rational points of bounded height in non-singular curves by applying the global determinant method.

Number Theory · Mathematics 2024-03-20 Chunhui Liu

We show that suitably defined systolic ratios are globally bounded from above on the space of rotationally symmetric spindle orbifolds and that the upper bound is attained precisely at so-called Besse metrics, i.e. Riemannian orbifold…

Differential Geometry · Mathematics 2021-08-31 Christian Lange , Tobias Soethe

We study the problem of $d$-gonality of the modular curve $X_0(N)$. As a result, we can give an upperbound of the level $N$ by means of $d$. This generalizes Ogg's result on hyperelliptic modular curves ($d = 2$). As a corollary of this…

alg-geom · Mathematics 2008-02-03 Khac Viet Nguyen , Masa-Hiko Saito

In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph $G=(V,E)$, together with two degree constraint functions $d^-,d^+ : V \to \mathbb{N}$. The goal is to orient as many edges as possible, in such a…

Data Structures and Algorithms · Computer Science 2014-10-13 Marek Cygan , Tomasz Kociumaka