Buscar
Mostrando ítems 31-40 de 475
Cluster values of holomorphic functions of bounded type
(American Mathematical Society, 2016-04)
We study the cluster value theorem for Hb(X), the Fréchet algebra of holomorphic functions bounded on bounded sets of X. We also describe the (size of) fibers of the spectrum of Hb(X). Our results are rather complete ...
Intersecting the torsion of elliptic curves
(2023)
Bogomolov and Tschinkel [‘Algebraic varieties over small fields’, Diophantine Geometry, U. Zannier (ed.), CRM Series, 4 (Scuola Normale Superiore di Pisa, Pisa, 2007), 73–91] proved that, given two complex elliptic curves ...
MPC for LPV systems with bounded parameter variations
(Taylor & Francis LtdAbingdonInglaterra, 2011)
Scattering and bound states of spinless particles in a mixed vector-scalar smooth step potential
(Academic Press Inc. Elsevier B.V., 2014)
Average complexity of exact and approximate multiple string matching
(ELSEVIER, 2004-08-16)
We show that the average number of characters examined to search for r random patterns of length m in a text of length n over a uniformly distributed alphabet of size a cannot be less than Omega(n log(sigma)(rm)/m). When ...
Characterization of semiglobal stability properties for discrete-time models of non-uniformly sampled nonlinear systems
(Elsevier Science, 2018-12)
Discrete-time models of non-uniformly sampled nonlinear systems under zero-order hold relate the next state sample to the current state sample, (constant) input value, and sampling interval. The exact discrete-time model, ...
An Extension of the Invariance Principle for a Class of Differential Equations with Finite Delay
(HINDAWI PUBLISHING CORPORATION, 2010)
An extension of the uniform invariance principle for ordinary differential equations with finite delay is developed. The uniform invariance principle allows the derivative of the auxiliary scalar function V to be positive ...
A concentration bound for the longest increasing subsequence of a randomly chosen involution
(ELSEVIER, 2006-08-15)
In this short note we prove a concentration result for the length of the longest increasing subsequence (LIS) of a randomly and uniformly chosen involution of {1,..., s}.