English
Related papers

Related papers: The sign-sequence constant of the plane

200 papers

Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes…

Combinatorics · Mathematics 2022-10-06 Alan Frieze , Wesley Pegden

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.

General Mathematics · Mathematics 2016-05-12 Yasemin Alagoz

We show that a uniformly acute triangulation of the plane is rigid under Luo's discrete conformal change, extending previous results on hexagonal triangulations. Our result is a discrete analogue of the conformal rigidity of the plane. We…

Geometric Topology · Mathematics 2022-08-09 Tianqi Wu

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

Number Theory · Mathematics 2025-08-29 Omkar Baraskar , Ingrid Vukusic

The Stern sequence (s(n)) is defined by s(0) = 0, s(1) = 1, s(2n) = s(n), s(2n+1) = s(n) + s(n+1). Stern showed in 1858 that gcd(s(n),s(n+1)) = 1, and that for every pair of relatively prime positive integers (a,b), there exists a unique n…

Number Theory · Mathematics 2007-05-23 Bruce Reznick

We address the problem of computing bounds for the self-intersection number (the minimum number of self-intersection points) of members of a free homotopy class of curves in the doubly-punctured plane as a function of their combinatorial…

Geometric Topology · Mathematics 2010-01-27 Moira Chas , Anthony Phillips

We seek for lines of minimal distance to finitely many points in the plane. The distance between a line and a set of points is defined by the L^p-norm, 1\leq p\leq \infty, of the vector of vertical or orthogonal distances from the single…

Optimization and Control · Mathematics 2011-09-21 Annett Puettmann

We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a…

Logic · Mathematics 2020-02-19 G. Conant , A. Pillay , C. Terry

Let $X$ be a surface and let $L$ be an ample line bundle on $X$. We first obtain a lower bound for the Seshadri constant $\varepsilon(X,L,r)$, when $r \ge 3$. We then assume that $X$ is a ruled surface and study Seshadri constants on $X$ in…

Algebraic Geometry · Mathematics 2017-01-25 Krishna Hanumanthu , Alapan Mukhopadhyay

We exhibit the densest sequence on the unit circle R/Z, x_k= log(2k-1)/log(2) (mod 1).

Number Theory · Mathematics 2009-06-02 Michael Boshernitzan , Jon Chaika

We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…

Probability · Mathematics 2022-07-12 Philip Lamkin , Tomasz Tkocz

An integer $n\ge 1$ is said to be practical if every natural number $ m \le n$ can be expressed as a sum of distinct positive divisors of $n$. The number of practical numbers up to $x$ is asymptotic to $c x/\log x$, where $c$ is a constant.…

Number Theory · Mathematics 2019-08-30 Andreas Weingartner

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

Number Theory · Mathematics 2019-01-08 Daniele Mastrostefano

We show that a constant factor approximation of the shortest and closest lattice vector problem in any norm can be computed in time $2^{0.802\, n}$. This contrasts the corresponding $2^n$ time, (gap)-SETH based lower bounds for these…

Data Structures and Algorithms · Computer Science 2021-10-07 Thomas Rothvoss , Moritz Venzin

We discuss the global regularity of 2 dimensional minimal sets that are near a union of two planes, and prove that every global minimal set in R^4 that looks like a union of two almost orthogonal planes at infinity is a cone. The main point…

Classical Analysis and ODEs · Mathematics 2012-05-15 Xiangyu Liang

A new and simple proof of the embedding of the Hardy--Hilbert space of Dirichlet series into a conformally invariant Hardy space of the half-plane is presented, and the optimal constant of the embedding is computed.

Functional Analysis · Mathematics 2018-07-24 Ole Fredrik Brevig

We prove that, for $q$ odd, a set of $q+2$ points in the projective plane over the field with $q$ elements has at least $2q-c$ odd secants, where $c$ is a constant and an odd secant is a line incident with an odd number of points of the…

Combinatorics · Mathematics 2020-02-19 Simeon Ball , Bence Csajbók

Schmidt proved in 2014 that if $\varepsilon>0$, almost all binary sequences of length $n$ have peak sidelobe level between $(\sqrt{2}-\varepsilon)\sqrt{n\log n}$ and $(\sqrt{2}+\varepsilon)\sqrt{n\log n}$. Because of the small gap between…

Combinatorics · Mathematics 2015-12-04 Idris Mercer

Balls are shown to have the smallest optimal constant, among all admissible Euclidean domains, in Poincar\'e type boundary trace inequalities for functions of bounded variation with vanishing median or mean value.

Optimization and Control · Mathematics 2013-01-25 Andrea Cianchi , Vincenzo Ferone , Carlo Nitsch , Cristina Trombetti