English
Related papers

Related papers: On one problem of Gowers

200 papers

Nested Archimedean copulas recently gained interest since they generalize the well-known class of Archimedean copulas to allow for partial asymmetry. Sampling algorithms and strategies have been well investigated for nested Archimedean…

Statistics Theory · Mathematics 2012-10-30 Marius Hofert , David Pham

Let $s \geq 3$ be a fixed positive integer and $a_1,\dots,a_s \in \mathbb{Z}$ be arbitrary. We show that, on average over $k$, the density of numbers represented by the degree $k$ diagonal form \[ a_1 x_1^k + \cdots + a_s x_s^k \] decays…

Number Theory · Mathematics 2018-05-02 Brandon Hanson , Asif Zaman

Let $k,d,\lambda \geqslant 1$ be integers with $d\geqslant \lambda $ and let $X$ be a finite set of points in $\mathbb{R}^{d}$. A $(d-\lambda)$-plane $L$ transversal to the convex hulls of all $k$-sets of $X$ is called Kneser transversal.…

It is well known that a graph with $m$ edges can be made triangle-free by removing (slightly less than) $m/2$ edges. On the other hand, there are many classes of graphs which are hard to make triangle-free in the sense that it is necessary…

Combinatorics · Mathematics 2010-09-03 Raphael Yuster

We prove that every additive set $A$ with energy $E(A)\ge |A|^3/K$ has a subset $A'\subseteq A$ of size $|A'|\ge (1-\varepsilon)K^{-1/2}|A|$ such that $|A'-A'|\le O_\varepsilon(K^{4}|A'|)$. This is, essentially, the largest structured set…

Combinatorics · Mathematics 2024-10-08 Christian Reiher , Tomasz Schoen

Let $\mathcal{P}$ and $\mathbb{N}$ be the sets of all primes and natural numbers, respectively. In this article, it is proved that there has a positive lower density of the natural numbers which can be represented by the form…

Number Theory · Mathematics 2022-04-25 Yuchen Ding

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

Number Theory · Mathematics 2007-05-23 Pieter Moree

In this paper, we study a density version of the Waring-Goldbach problem. Suppose that A is a subset of the primes, and the lower density of A in the primes is larger than 1-1/2k. We prove that every sufficiently large natural number n…

Number Theory · Mathematics 2023-12-19 Meng Gao

Let ABC be a triangle with a,b,and c being its three sidelengths. In a 1976 article by Wynne William Wilson in the Mathematical Gazette(see reference[2]), the author showed that angleB is twice angleA, if and only if b^2=a(a+c). We offer…

General Mathematics · Mathematics 2012-08-03 Konstantine Zelator

The ratio set of a set of positive integers $A$ is defined as $R(A) := \{a / b : a, b \in A\}$. The study of the denseness of $R(A)$ in the set of positive real numbers is a classical topic and, more recently, the denseness in the set of…

Number Theory · Mathematics 2020-12-15 Piotr Miska , Carlo Sanna

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

Group Theory · Mathematics 2022-05-13 Tony N. Mavely , Viji Z. Thomas

Let a be a positive integer greater than 1, and Q_a(x;k,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo k. In this paper, the natural densities of Q_a(x;4,j) (j=0,1,2,3) are…

Number Theory · Mathematics 2007-05-23 K. Chinen , L. Murata

In this paper I present a new method of studying the densities of the Collatz trajectories generated by a set $S \subset \mathbb{N}$. This method is used to furnish an alternative proof that $d(\{y \in \mathbb{N} : \exists k \text{ where }…

Number Theory · Mathematics 2020-10-16 John Cooper Faile

Let $\mathbf{D}=(D_{n})_{n\geq 1}$ be an elliptic divisibility sequence associated to the pair $(E,P)$. For a fixed integer $k$, we define $\mathscr{A}_{E,k}=\{n\geq 1 : \gcd(n,D_{n})=k\}$. We give an explicit structural description of…

Number Theory · Mathematics 2017-08-29 Seoyoung Kim

Consider the set $M_{a,b} = \{n \in \mathbb Z_{\ge 1} : n \equiv a \bmod b\} \cup \{1\}$ for $a, b \in \mathbb Z_{\ge 1}$. If $a^2 \equiv a \bmod b$, then $M_{a,b}$ is closed under multiplication and known as an arithmetic congruence monoid…

Number Theory · Mathematics 2023-10-13 Nils Olsson , Christopher O'Neill , Derek Rawling

We prove a lower bound of exp(-C (log(2/alpha))^7)N^{k-1} to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the…

Number Theory · Mathematics 2023-06-16 Tomasz Kosciuszko

In an additive group (G,+), a three-dimensional corner is the four points g, g+d(1,0,0), g+d(0,1,0), g+d(0,0,1), where g is in G^3, and d is a non-zero element of G. The Ramsey number of interest is R_3(G) the maximal cardinality of a…

Number Theory · Mathematics 2008-04-21 Michael T. Lacey , William McClain

An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…

Combinatorics · Mathematics 2010-09-23 Matthew Kahle

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term…

Combinatorics · Mathematics 2007-05-23 Bruce Landman , Aaron Robertson

A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…

Combinatorics · Mathematics 2021-04-16 Pim van der Hoorn , Gabor Lippner , Elchanan Mossel