Results 101 to 110 of about 627,608 (258)
Mean‐field limit of non‐exchangeable systems
Abstract This paper deals with the derivation of the mean‐field limit for multi‐agent systems on a large class of sparse graphs. More specifically, the case of non‐exchangeable multi‐agent systems consisting of non‐identical agents is addressed. The analysis does not only involve PDEs and stochastic analysis but also graph theory through a new concept ...
Pierre‐Emmanuel Jabin+2 more
wiley +1 more source
We use the properties of superquadratic functions to produce various improvements and popularizations on time scales of the Hardy form inequalities and their converses.
H. M. Rezk+4 more
doaj +1 more source
ABSTRACT Steering a nonlinear system from an initial state to a desired one is a common task in control. While a nominal trajectory can be obtained rather systematically using a model, for example, via numerical optimization, heuristics, or reinforcement learning, the design of a computationally fast and reliable feedback control law that guarantees ...
Nicolas Kessler, Lorenzo Fagiano
wiley +1 more source
A note on the proofs of generalized Radon inequality [PDF]
In this paper, we introduce and prove several generalizations of the Radon inequality. The proofs in the current paper unify and also are simpler than those in early published work.
Yongtao Li, Xian-Ming Gu, Xiao Jianci
doaj
Local spectral estimates and quantitative weak mixing for substitution Z${\mathbb {Z}}$‐actions
Abstract The paper investigates Hölder and log‐Hölder regularity of spectral measures for weakly mixing substitutions and the related question of quantitative weak mixing. It is assumed that the substitution is primitive, aperiodic, and its substitution matrix is irreducible over the rationals.
Alexander I. Bufetov+2 more
wiley +1 more source
Generalization of the Brunn–Minkowski Inequality in the Form of Hadwiger [PDF]
A class of domain functionals has been built in the Euclidean space. The Brunn–Minkowski type of inequality has been applied to the said class and proved for it.
B.S. Timergaliev
doaj
The converse theorem for Minkowski's inequality
AbstractLet (Ω, Σ, μ) be a measure space and ϕ, ψ : (0, ∞) → (0, ∞) some bijective functions. Suppose that the functional Pϕ,ψ defined on class of μ-integrable simple functions χ : Ω → [0, ∞), μ({ϖ : χ(ϕ) > 0} > 0, by the formula Pϕ,ψ(χ) = ψ∫{χ>0}ϕo χdμ satisfies the triangle inequality. We prove that if there are A, B ϵ Σ such that 0 < μ(A) < 1 < μ(B)
openaire +2 more sources
Lattices in function fields and applications
Abstract In recent decades, the use of ideas from Minkowski's Geometry of Numbers has gained recognition as a helpful tool in bounding the number of solutions to modular congruences with variables from short intervals. In 1941, Mahler introduced an analogue to the Geometry of Numbers in function fields over finite fields.
Christian Bagshaw, Bryce Kerr
wiley +1 more source
On the stability of Brunn–Minkowski type inequalities
name ...
COLESANTI, ANDREA+2 more
openaire +5 more sources
Counting integral points on symmetric varieties with applications to arithmetic statistics
Abstract In this article, we combine Bhargava's geometry‐of‐numbers methods with the dynamical point‐counting methods of Eskin–McMullen and Benoist–Oh to develop a new technique for counting integral points on symmetric varieties lying within fundamental domains for coregular representations.
Arul Shankar+2 more
wiley +1 more source