English
Related papers

Related papers: Structure Theorem for (d,g,h)-Maps

200 papers

In this article, for generalized projective spaces with any weights, we prove four main theorems in three different contexts where the Unital Set Condition USC (Definition $2.8$) on ideals is further examined. In the first context we prove,…

Number Theory · Mathematics 2022-12-20 C P Anil Kumar

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned…

Combinatorics · Mathematics 2015-12-24 Katherine Edwards , Dong Yeap Kang , Jaehoon Kim , Sang-il Oum , Paul Seymour

In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…

Combinatorics · Mathematics 2017-05-17 Daniela Kühn , Allan Lo , Deryk Osthus , Katherine Staden

An open conjecture of Z.-W. Sun states that for any integer $n>1$ there is a positive integer $k\le n$ such that $\pi(kn)$ is prime, where $\pi(x)$ denotes the number of primes not exceeding $x$. In this paper, we show that for any positive…

Number Theory · Mathematics 2020-04-03 Zhi-Wei Sun , Lilu Zhao

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

Combinatorics · Mathematics 2024-11-22 Hung-Hsun Hans Yu , Yufei Zhao

The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…

Combinatorics · Mathematics 2011-06-02 Jiří Matoušek , Martin Tancer , Uli Wagner

For a fixed rational number g and integers a and d the sets N_g(a,d), respectively R_g(a,d), of primes p for which the order, respectively the index of g(mod p) is congruent to a(mod d), are considered. Under the Generalized Riemann…

Number Theory · Mathematics 2007-05-23 Pieter Moree

We here elaborate on a quantitative argument to support the validity of the Collatz conjecture, also known as the (3x + 1) or Syracuse conjecture. The analysis is structured as follows. First, three distinct fixed points are found for the…

Dynamical Systems · Mathematics 2016-12-28 Timoteo Carletti , Duccio Fanelli

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

Combinatorics · Mathematics 2017-06-07 Brian Cook , Ákos Magyar , Malabika Pramanik

A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…

Combinatorics · Mathematics 2026-01-14 Andrew Suk , Ji Zeng

We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…

Combinatorics · Mathematics 2016-05-06 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Mohamed Omar

The Wiener index of a strong digraph $D$ is defined as the sum of the distances between all ordered pairs of vertices. This definition has been extended to digraphs that are not necessarily strong by defining the distance from a vertex $a$…

Combinatorics · Mathematics 2022-09-20 Peter Dankelmann

Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r = 2$, the conjecture is simply K\"onig's Theorem and every bipartite graph is a…

Combinatorics · Mathematics 2016-06-21 Penny Haxell , Lothar Narins , Tibor Szabó

An infinite 3-parametric family of superintegrable and exactly-solvable quantum models on a plane, admitting separation of variables in polar coordinates, marked by integer index $k$ was introduced in Journ Phys A 42 (2009) 242001 and was…

Mathematical Physics · Physics 2026-05-06 Juan Carlos López Vieyra , Alexander V Turbiner

We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set $A$ whose indicator function is 'approximately multiplicative' and uniformly distributed on short…

Number Theory · Mathematics 2019-12-04 Terence Tao , Joni Teräväinen

Many of the 2-adic properties of the 3x+1 map generalize to the analogous mx+r map, where m and r are odd integers. We introduce the corresponding autoconjugacy map, prove some simple properties of it and make some further conjectures in…

Number Theory · Mathematics 2012-06-05 Alec Edgington

We present some interesting observations on the 3x+1 problem. We propose a new algorithm which eliminates certain steps while we check the action of 3x+1 procedure on a number. Also, we propose a reason why many numbers follow a similar…

General Mathematics · Mathematics 2007-05-23 Dhananjay P. Mehendale

In this article we consider large data Wave-Maps from $\mathbb{R}^{2+1}$ into a compact Riemannian manifold $(\mathcal{M},g)$, and we prove that regularity and dispersive bounds persist as long as a certain type of bulk (non-dispersive)…

Analysis of PDEs · Mathematics 2015-05-13 Jacob Sterbenz , Daniel Tataru

Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$, where $t = \max\{|X|,|Y |\}$, contains a subtree $T' \cong T$ such that $G-V(T')$…

Combinatorics · Mathematics 2024-03-07 Qing Yang , Yingzhi Tian