English
Related papers

Related papers: Systems of several first-order quadratic recursion…

200 papers

We propose a notion of iterating functions $f:X^{k}\rightarrow X$ in a way that represents recurrence relations of the form $a_{n+k}=f(a_{n},a_{n+1},...,a_{n+k-1})$. We define a function as $n$-involutory when its $n$th iterate is the…

General Mathematics · Mathematics 2020-11-02 Suneil Parimoo

We consider stochastic dynamical systems defined by differential equations with a uniform random time delay. The latter equations are shown to be equivalent to deterministic higher-order differential equations: for an $n$-th order equation…

Statistical Mechanics · Physics 2011-10-11 P. L. Krapivsky , J. M. Luck , K. Mallick

An extension of standard quantum mechanics is proposed in which the Newtonian time appearing as a parameter in the unitary evolution operator is replaced with the time shown by a `quantum clock'. Such a clock is defined by the following…

Quantum Physics · Physics 2026-03-17 Dorje C. Brody , Lane P. Hughston

Relativistically, time $t$ is an observable just like position $r$. In quantum theory, $t$ is a parameter, in contrast to the observable $r$. This discrepancy suggests that there exists a more elaborate formalization of time, which…

Quantum Physics · Physics 2019-01-08 Per Östborn

We study properties of an array of numbers, called "the triangle," in which each row is formed by rotating all the numbers in the previous row to the left by $m$ positions in cyclical fashion, then appending a number to the end of the row.…

Number Theory · Mathematics 2014-09-16 Philip Jameson Graber

Given integers $n,k,\ell$ such that $0<k<n, \; 1<\ell$ and an integer vector $x = (x_1,\ldots,x_n)$; denote by $m = m(x)$ the number of entries of $x$ that are multiple of $\ell$. Choose $n-k$ entries of $x$ as follows: if $n-k \leq m(x)$,…

Combinatorics · Mathematics 2023-12-15 Vladimir Gurvich , Mariya Naumova

In this paper the approach to obtaining nonrecurrent formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some…

Combinatorics · Mathematics 2019-11-05 Sergei Kazenas

In this paper, we present series representations of the remainders in the expansions for $2/(e^t+1)$, $\mbox{sech} t$ and $\coth t$. For example, we prove that for $t > 0$ and $N\in\mathbb{N}:=\{1, 2, \ldots\}$, \[\mbox{sech}\,…

Classical Analysis and ODEs · Mathematics 2016-01-12 C. -P. Chen , R. B. Paris

The (1+1)-evolution strategy (ES) with success-based step-size adaptation is analyzed on a general convex quadratic function and its monotone transformation, that is, $f(x) = g((x - x^*)^\mathrm{T} H (x - x^*))$, where…

Neural and Evolutionary Computing · Computer Science 2021-04-13 Daiki Morinaga , Kazuto Fukuchi , Jun Sakuma , Youhei Akimoto

In this paper an approach to generate multi-dimensionally consistent $N$-component systems is proposed. The approach starts from scalar multi-dimensionally consistent quadrilateral systems and makes use of the cyclic group. The obtained…

Exactly Solvable and Integrable Systems · Physics 2020-07-02 Dan-Da Zhang , Peter H. van der Kamp , Da-Jun Zhang

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

Number Theory · Mathematics 2014-04-15 Jonathan Burns

Using the Carleman linearization technique the continuous iteration of a mapping is studied. Based on the detailed analysis of the Carleman embedding matrix the precise mathematical meaning is given to such notion. The ordinary differential…

Mathematical Physics · Physics 2007-05-23 P. Gralewicz , K. Kowalski

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

Number Theory · Mathematics 2023-02-15 Benjamin Matschke , Abhijit S. Mudigonda

Most research in the theory of evolutionary computation assumes that the problem at hand has a fixed problem size. This assumption does not always apply to real-world optimization challenges, where the length of an optimal solution may be…

Neural and Evolutionary Computing · Computer Science 2015-06-22 Benjamin Doerr , Carola Doerr , Timo Kötzing

Validation is a major challenge in differentiable programming. The state of the art is based on algorithmic differentiation. Consistency of first-order tangent and adjoint programs is defined by a well-known first-order differential…

Numerical Analysis · Mathematics 2021-01-12 Uwe Naumann

We investigate how the accuracy and stability of numerical relativity simulations of 1D colliding plane waves depends on choices of equation formulations, gauge conditions, boundary conditions, and numerical methods, all in the context of a…

General Relativity and Quantum Cosmology · Physics 2009-11-07 J. M. Bardeen , L. T. Buchman

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

We provide sufficient criteria for the oscillation of all solutions of neutral delay differential equations of the form \[ \left[x(t) - \sum_{i=1}^{N_r}R_i(t)x(t - r_i(t)) \right]' + \sum_{i=1}^{N_p}P_i(t)x(t - \tau_i(t)) -…

Dynamical Systems · Mathematics 2026-02-09 Ábel Garab , Gergő Tóth

We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…

Number Theory · Mathematics 2024-11-26 Noam Kimmel , Vivian Kuperberg

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

Number Theory · Mathematics 2020-01-28 Matt Hohertz , Bahman Kalantari
‹ Prev 1 8 9 10 Next ›