English
Related papers

Related papers: On the size of a linear combination of two linear …

200 papers

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

Group Theory · Mathematics 2021-12-06 Robert Lin

The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Science 171 (2001), pp. 47--58]. Namely, we consider the…

Logic · Mathematics 2019-02-05 Nikolay Vereshchagin

We will show that in the conformal class of the standard metric $g_{S^n}$ on $S^n$, the scaling invariant functional $(\mu_g(S^n))^{\frac{2m-n}{n}}\int_{S^n}Q_{2m,g}d\mu_g$ maximizes at $g_{S^n}$ when $n$ is odd and $m=\frac{n+1}{2}$ or…

Differential Geometry · Mathematics 2007-05-23 Fengbo Hang

Given a closed Riemannian manifold $(M^{n+1},g)$,$3\leq n+1\leq7$.In this paper,we will prove that for any $c>0$,suppose the number of closed $c-CMC$ hypersurfaces is finite,then there exists a metric $h$ on $M$ such that the $c-CMC$…

Differential Geometry · Mathematics 2026-04-24 Xiaoxiang Jiao , Wenduo Zou

Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…

Number Theory · Mathematics 2019-03-19 Carlos Alirio Rico Acevedo , Ana Paula Chaves

We discuss when two rational functions $f$ and $g$ can have the same measure of maximal entropy. The polynomial case was completed by (Beardon, Levin, Baker-Eremenko,Schmidt-Steinmetz, etc., 1980s-90s), and we address the rational case…

Dynamical Systems · Mathematics 2014-09-29 Hexi Ye

We account some detailed calculation of irreducible character values of $G_n$ with application to estimate fiber size of the commutator map over regular semisimple and central elements of $\SL_n$.

Representation Theory · Mathematics 2021-04-15 Zhipeng Lu

We consider a parametrised family of Thue equations, \[ (x-G_1(n)\, y) \cdots (x-G_d(n)\, y) - y^d = \pm 1, \] which was first considered by Thomas to have an explicit set of solutions for parameters $n$ larger than some effectively…

Number Theory · Mathematics 2024-06-04 Tobias Hilgart

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson , Kevin O'Bryant , Brooke Orosz , Imre Ruzsa , Manuel Silva

We prove that for a homogeneous linear partial differential operator $\mathcal A$ of order $k \le 2$ and an integrable map $f$ taking values in the essential range of that operator, there exists a function $u$ of special bounded variation…

Analysis of PDEs · Mathematics 2023-10-06 Adolfo Arroyo-Rabasa

A sequence $\mathbf{A}$ is said to be realizable if satisfies so called sign and Dold conditions. We will say that a sequence almost satisfies the Dold condition if there exists a constant $c\in\mathbb{N}_+$ such that…

Number Theory · Mathematics 2025-09-15 Mateusz Rajs

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Symbolic Computation · Computer Science 2007-05-23 Martin Ziegler

We initiate the study of the sets $H(c)$, $0<c<1$, of real $x$ for which the sequence $(kx)_{k\geq1}$ (viewed mod 1) consistently hits the interval $[0,c)$ at least as often as expected (i. e., with frequency $\geq c$). More formally, \[…

Number Theory · Mathematics 2009-11-12 Michael Boshernitzan , David Ralston

In this article we consider the following equivalence relation on the class of all functions of two variables on a set $X$: we will say that $L,M: X\times X\to \mathbb{C}$ are rescalings if there are non-vanishing functions $f,g$ on $X$…

Functional Analysis · Mathematics 2019-08-27 Eugene Bilokopytov

Let $p_{n}$ denote the $n$th prime and for any fixed positive integer $k$ and $X\geq 2$, put \[ G_{k}(X):=\max _{p _{n+k}\leq X} \min \{ p_{n+1}-p_{n}, \ldots , p_{n+k}-p_{n+k-1} \}. \] Ford, Maynard and Tao proved that there exists an…

Number Theory · Mathematics 2024-06-06 Keiju Sono

A function $f$ on a topological space is sequentially continuous at a point $u$ if, given a sequence $(x_{n})$, $\lim x_{n}=u$ implies that $\lim f(x_{n})=f(u)$. This definition was modified by Connor and Grosse-Erdmann for real functions…

General Topology · Mathematics 2010-11-12 Huseyin Cakalli

We extend to the multilinear setting classical inequalities of Marcinkiewicz and Zygmund on $\ell^r$-valued extensions of linear operators. We show that for certain $1 \leq p, q_1, \dots, q_m, r \leq \infty$, there is a constant $C\geq 0$…

Functional Analysis · Mathematics 2017-08-31 Daniel Carando , Martin Mazzitelli , Sheldy Ombrosi

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

Number Theory · Mathematics 2024-03-22 Florian Luca , Tom Ward

Let $1 < p \neq q < \infty $ and $(D, \mu) = (\{\pm 1\}, 1/2 \delta_{-1} + 1/2 \delta_1)$. Define by recursion: $X_0 = \C$ and $X_{n+1} = L_p(\mu; L_q(\mu; X_n))$. In this paper, we show that there exist $c_1=c_1(p, q)>1$ depending only on…

Functional Analysis · Mathematics 2012-06-07 Yanqi Qiu
‹ Prev 1 3 4 5 6 7 10 Next ›