English
Related papers

Related papers: Bonded Trajectories of the $3x+\gamma$ Problem

200 papers

Let $\Omega \subset \mathbb{R}^N$, $N \geq 2$, be a smooth bounded domain. We consider the boundary value problem \begin{equation} \label{Plambda-Abstract-ch3} \tag{$P_{\lambda}$} -\Delta u = c_{\lambda}(x) u + \mu |\nabla u|^2 + h(x)\,,…

Analysis of PDEs · Mathematics 2019-09-12 Colette De Coster , Antonio J. Fernández

Gram's Law describes a pattern that frequently occurs in the distribution of the non-trivial zeros of the Riemann zeta function along the critical line. Whenever Gram's Law holds true, it reduces the difficulty of computing the…

Number Theory · Mathematics 2020-06-02 Cătălin Hanga , Christopher Hughes

The Goldbach conjecture states that every even number can be decomposed as the sum of two primes. Let $D(N)$ denote the number of such prime decompositions for an even $N$. It is known that $D(N)$ can be bounded above by $$ D(N) \leq C^*…

History and Overview · Mathematics 2018-01-08 David Quarel

A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…

Rings and Algebras · Mathematics 2018-03-30 Daniel P. Bossaller , Sergio R. López-Permouth

The $3x+1$ problem, also called the Collatz conjecture, is a very interesting unsolved mathematical problem related to computer science. This paper generalized this problem by relaxing the constraints, i.e., generalizing this deterministic…

Computational Complexity · Computer Science 2013-11-25 Bojin Zheng , Yangqian Su , Hongrun Wu , Li Kuang

For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and let S_n(x) be the sum of the first n R_i(x). {S_n} is the…

Probability · Mathematics 2019-11-13 Vladimir Dobric , Marina Skyers , Lee J. Stanley

This thesis generalizes the study of $C\cap(C + \alpha)$ where $C$ is the middle third Cantor set to self-affine sets in $\mathbb{R}^{n}$. We present sufficient and necessary conditions for when the translation $\alpha$ produces a…

Dynamical Systems · Mathematics 2026-04-23 Neil MacVicar

Given $A\subseteq\mathbb Z_n$, the constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence having consecutive terms. The value of…

Number Theory · Mathematics 2023-04-06 Santanu Mondal , Krishnendu Paul , Shameek Paul

In this paper, we study the zero sets of the confluent hypergeometric function $_{1}F_{1}(\alpha;\gamma;z):=\sum_{n=0}^{\infty}\frac{(\alpha)_{n}}{n!(\gamma)_{n}}z^{n}$, where $\alpha, \gamma, \gamma-\alpha\not\in \mathbb{Z}_{\leq 0}$, and…

Classical Analysis and ODEs · Mathematics 2015-10-06 Wei-Chuan Lin , Xu-Dan Luo

Let $\Gamma$ be a finite subgroup of SU(2) and let $\widetilde {\Gamma} = \{\gamma_i\mid i\in J\}$ be the unitary dual of $\Gamma$. The unitary dual of SU(2) may be written $\{\pi_n\mid n\in \Bbb Z_+\}$ where $dim \pi_n = n+1$. For $n\in…

Representation Theory · Mathematics 2007-05-23 Bertram Kostant

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

Number Theory · Mathematics 2020-07-28 Paul Pollack

Let n>=3 be an odd integer. For any integer a prime to n, define the permutation gamma_{a,n} of {1,...,(n-1)/2} by gamma_{a,n}(x)=n-\dec{ax}_n if {ax}_n>=(n+1)/2, and {ax}_n if {ax}_n<=(n-1)/2, where {x}_n denotes the least nonnegative…

Number Theory · Mathematics 2007-05-23 Hao Pan

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=0$. We show $\Gamma$ is 3-bounded in the sense of the article [D-bounded…

Combinatorics · Mathematics 2007-09-06 Yeh-jong Pan , Chih-wen Weng

Suppose that the Riemann hypothesis is false and $\rho_{*} = 1/2 + \eta_{*} + i \gamma_{*}$, $\eta_{*} > 0$, is a nontrivial zero of the Riemann $\zeta$-function off the critical line. Under the negation of the Riemann hypothesis for the…

General Mathematics · Mathematics 2026-03-10 Hisanobu Shinya

The ternary Goldbach conjecture (or three-prime conjecture) states that every odd number greater than 5 can be written as the sum of three primes. The purpose of this book is to give the first proof of the conjecture, in full.

Number Theory · Mathematics 2015-01-29 Harald Andres Helfgott

We begin by considering second order dynamical systems of the from $\ddot x(t) + \gamma(t)\dot x(t) + \lambda(t)B(x(t))=0$, where $B: {\cal H}\rightarrow{\cal H}$ is a cocoercive operator defined on a real Hilbert space ${\cal H}$,…

Optimization and Control · Mathematics 2016-03-10 Radu Ioan Bot , Ernö Robert Csetnek

Let $\gamma > 0\,$, $\beta > 0\,$, $\alpha > 0$ and $0 < \sigma N < 4$. In the present paper, we study, for $c > 0$ given, the constrained minimization problem \begin{equation*} \label{MinL2fixed} m(c):=\inf_{u\in S (c) }E(u),…

Analysis of PDEs · Mathematics 2020-12-16 Nabile Boussaïd , Antonio J. Fernández , Louis Jeanjean

In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…

Number Theory · Mathematics 2025-10-02 Yagub N. Aliyev

Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…

Data Structures and Algorithms · Computer Science 2025-10-06 Ethan Torres , Ramavarapu Sreenivas , Richard Sowers

I begin with a simple modular form motivated proof of the following: Let $C_{n}$ in $Z/2[[t]]$ be defined by $C_{n+4} = C_{n+3} + (t^{4}+t^{3}+t^{2}+t)C_{n} + t^{n}(t^{2}+t)$, with initial values $0$, $1$, $t$ and $t^{2}$ for $C_{0}$,…

Number Theory · Mathematics 2016-03-15 Paul Monsky