English
Related papers

Related papers: On particular diameter bounds for integral point s…

200 papers

The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…

Combinatorics · Mathematics 2014-11-27 Steffen Borgwardt , Jesús A. De Loera , Elisabeth Finhold

We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to…

Combinatorics · Mathematics 2015-03-26 Ramiro Feria-Puron , Hebert Perez-Roses , Joe Ryan

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

Combinatorics · Mathematics 2012-04-26 A. A. Lopatin

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

Combinatorics · Mathematics 2010-06-15 Radoslav Fulek , Filip Morić , David Pritchard

We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.

Number Theory · Mathematics 2019-08-30 Jean-Marc Couveignes

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

Number Theory · Mathematics 2012-10-31 Gary L. Mullen , Daqing Wan , Qiang Wang

In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…

Combinatorics · Mathematics 2024-11-13 Csaba Biro , Sida Wan

The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…

Optimization and Control · Mathematics 2020-01-28 Vu Trung Hieu

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

Combinatorics · Mathematics 2017-02-07 Filip Cools , Alexander Lemmens

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…

Differential Geometry · Mathematics 2023-01-11 Tatsuya Miura

We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…

Combinatorics · Mathematics 2019-06-03 Francisco Criado , Andrew Newman

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

Combinatorics · Mathematics 2008-12-31 Alexander Dainiak

We derive an upper bound for the Assouad dimension of visible parts of self-similar sets generated by iterated function systems with finite rotation groups and satisfying the open set condition. The bound is valid for all visible parts and…

Dynamical Systems · Mathematics 2022-03-21 Esa Järvenpää , Maarit Järvenpää , Ville Suomala , Meng Wu

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Joerg Schepers

The aim of this paper is to give an upper bound for the intrinsic diameter of a surface with boundary immersed in a conformally flat three dimensional Riemannian manifold in terms of the integral of the mean curvature and of the length of…

Differential Geometry · Mathematics 2023-03-20 Marco Flaim , Christian Scharrer

We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)

Combinatorics · Mathematics 2011-09-06 György Elekes

Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…

Combinatorics · Mathematics 2015-10-16 Michael Kiermaier , Sascha Kurz

Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…

General Relativity and Quantum Cosmology · Physics 2024-01-03 Lee Lindblom , Oliver Rinne

Motivated by integral point sets in the Euclidean plane, we consider integral point sets in affine planes over finite fields. An integral point set is a set of points in the affine plane $\mathbb{F}_q^2$ over a finite field $\mathbb{F}_q$,…

Combinatorics · Mathematics 2015-10-16 Michael Kiermaier , Sascha Kurz