English
Related papers

Related papers: The right acute angles problem?

200 papers

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

Combinatorics · Mathematics 2014-03-03 Kaushik Majumder

We study a lattice point counting problem for spheres arising from the Heisenberg groups. In particular, we prove an upper bound on the number of points on and near large dilates of the unit spheres generated by the anisotropic norms…

Classical Analysis and ODEs · Mathematics 2022-05-05 Elizabeth Campolongo , Krystal Taylor

This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…

Combinatorics · Mathematics 2020-12-01 Chengcheng Yang

The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of this phenomenon in two types of cut problems in directed…

Data Structures and Algorithms · Computer Science 2017-07-07 Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Euiwoong Lee , Chao Xu

Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The incident angles of a vertex $p \in S$ of $G$ are the angles between any two edges of $G$ that appear consecutively in the circular…

A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…

Combinatorics · Mathematics 2017-08-08 Niran Abbas Ali , Gek L. Chiab , Hazim Michman Trao , Adem Kilicman

We develop a branch-and-bound algorithm for the integer D-optimality problem, a central problem in statistical design theory, based on two convex relaxations, employing variable-bound tightening and fast local-search procedures, testing our…

Optimization and Control · Mathematics 2024-09-10 Gabriel Ponte , Marcia Fampa , Jon Lee

Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. Cerf (2015) pointed out that from classical work by Aizenman, Kesten and Newman (1987) and Gandolfi, Grimmett and Russo (1988) one can obtain that the two-arms exponent…

Probability · Mathematics 2020-09-29 Jacob van den Berg , Diederik van Engelenburg

This paper proposes and studies new quantum version of $f$-divergences, a class of convex functionals of a pair of probability distributions including Kullback-Leibler divergence, Rnyi-type relative entropy and so on. There are several…

Quantum Physics · Physics 2018-02-07 Keiji Matsumoto

The first goal of this paper is to prove a sharp condition to guarantee of having a positive proportion of all congruence classes of triangles in given sets in $\mathbb{F}_q^2$. More precisely, for $A, B, C\subset \mathbb{F}_q^2$, if…

Combinatorics · Mathematics 2023-08-16 Thang Pham

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

Combinatorics · Mathematics 2012-03-22 Daniel Kral , Lukas Mach , Jean-Sebastien Sereni

The `global' Zarankiewicz problem for hypergraphs asks for an upper bound on the number of edges of a finite $r$-hypergraph $V$ in terms of the number $|V|$ of its vertices, assuming the edge relation is induced by a fixed $K_{k, \dots,…

Logic · Mathematics 2026-01-06 Pantelis E. Eleftheriou , Aris Papadopoulos

This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is…

Quantum Physics · Physics 2018-04-25 Guillaume Chapuis , Hristo N. Djidjev , Georg Hahn , Guillaume Rizk

Given an undirected graph and a size parameter $k$, the Densest $k$-Subgraph (D$k$S) problem extracts the subgraph on $k$ vertices with the largest number of induced edges. While D$k$S is NP--hard and difficult to approximate, penalty-based…

Signal Processing · Electrical Eng. & Systems 2025-11-18 Ya Liu , Junbin Liu , Wing-Kin Ma , Aritra Konar

We consider the inequalities of Gagliardo-Nirenberg and Sobolev in R^d, formulated in terms of the Laplacian Delta and of the fractional powers D^n := (-Delta)^(n/2) with real n >= 0; we review known facts and present novel results in this…

Functional Analysis · Mathematics 2018-08-03 Carlo Morosi , Livio Pizzocchero

In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum $d$-distance independent set problem and the minimum $d$-distance dominating set problem on unit disk…

Data Structures and Algorithms · Computer Science 2020-06-30 Sangram K. Jena , Ramesh K. Jallu , Gautam K. Das , Subhas C. Nandy

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer $d$ there is a constant $c_d > 0$ such that whenever $X_1,..., X_{d+1}$ are $n$-element subsets of $\mathbb{R}^d$, then we…

Metric Geometry · Mathematics 2015-10-20 Roman Karasev , Jan Kynčl , Pavel Paták , Zuzana Patáková , Martin Tancer

We establish a $\Gamma$-convergence result for $h\to 0$ of a thin nonlinearly elastic 3D-plate of thickness $h>0$ which is assumed to be glued to a support region in the 2D-plane $x_3=0$ over the $h$-2D-neighborhood of a given closed set…

Analysis of PDEs · Mathematics 2024-04-02 Antoine Lemenant , Mohammad Reza Pakzad

In this paper we propose some approaches for finding of pointwise estimates of a solution of the Dirichlet boundary value problem $-\Delta u \pm |u|^{q-1} u = 0 $, $|u|=k$ when $|x|=d<1$ and $|u|=0$ when $|x|=1$ where $x\in \Omega = \{x|…

Analysis of PDEs · Mathematics 2007-05-23 I. V. Burskii

Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…

Combinatorics · Mathematics 2022-07-29 Benny Sudakov , István Tomon