Results 61 to 70 of about 4,013,096 (184)
We establish large sets of Anderson localized states for the quasi-periodic nonlinear Schrödinger equation on Zd $\mathbb Z^d$ double struck upper Z Superscript d , thus extending Anderson localization from the linear (cf. Bourgain [Geom.
Yunfeng Shi, Wei-Min Wang
doaj +1 more source
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations [PDF]
Abstract: "The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic.
Himanshu Jain +2 more
openaire +4 more sources
Generalized free wreath products and their operator algebras
Abstract We develop a new approach on free wreath products, generalizing the constructions of Bichon and of Fima‐Pittau. We show stability properties for certain approximation properties such as exactness, Haagerup property, hyperlinearity, and K‐amenability. We study qualitative properties of the associated von Neumann algebra: factoriality, primeness,
Pierre Fima, Arthur Troupel
wiley +1 more source
This paper introduces a digital adaptive control framework for large-scale multivariable systems, integrating matrix linear Diophantine equations with block pole placement.
Belkacem Bekhiti +4 more
doaj +1 more source
Observability of string vibrations
Transversal vibrations $u=u(x,t)$ of a string of length $l$ under three essential boundary conditions are studied, where $u$ is governed by the Klein--Gordon equation: $$u_{tt}(x,t) = a^2u_{xx}(x,t) - cu(x,t), (x,t) \in [0,l]\times \mathbb{R}; \ 0 < a ...
András Szijártó, Jenő Hegedűs
doaj +1 more source
Moderate Deviation Principles for Lacunary Trigonometric Sums
ABSTRACT Classical works of Kac, Salem, and Zygmund, and Erdős and Gál have shown that lacunary trigonometric sums despite their dependency structure behave in various ways like sums of independent and identically distributed random variables. For instance, they satisfy a central limit theorem (CLT) and a law of the iterated logarithm.
Joscha Prochno, Marta Strzelecka
wiley +1 more source
On the exceptional set in Littlewood's discrete conjecture
Abstract We consider a discrete analogue of the well‐known Littlewood conjecture on Diophantine approximations and obtain a strong upper bound for the number of exceptional vectors in this conjecture.
I. D. Shkredov
wiley +1 more source
Discovery of Exact Equations for Integer Sequences
Equation discovery, also known as symbolic regression, is the field of machine learning that studies algorithms for discovering quantitative laws, expressed as closed-form equations or formulas, in collections of observed data.
Boštjan Gec +2 more
doaj +1 more source
Double‐jump phase transition for the reverse Littlewood–Offord problem
Abstract Erdős conjectured in 1945 that for any unit vectors v1,…,vn$v_1, \ldots, v_n$ in R2$\mathbb {R}^2$ and signs ε1,…,εn$\varepsilon _1, \ldots, \varepsilon _n$ taken independently and uniformly in {−1,1}$\lbrace -1,1\rbrace$, the random Rademacher sum σ=ε1v1+⋯+εnvn$\sigma = \varepsilon _1 v_1 + \cdots + \varepsilon _n v_n$ satisfies ∥σ∥2⩽1$\Vert \
Lawrence Hollom +2 more
wiley +1 more source
In the first chapter we have given some definations, theorems, lemmas on Elementary Number Theory. This brief discussion is useful for next discussion on the main topic.
Strnadová, Pavlína, Panda, Sagar
core

