Results 111 to 120 of about 238 (174)
The pants graph of a free group
Abstract We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants graph of a free group, consisting of all possible pants decompositions.
Donggyun Seo
wiley +1 more source
Bounded Variation Separates Weak and Strong Average Lipschitz. [PDF]
Elperin A, Kontorovich A.
europepmc +1 more source
ABSTRACT We study eigenvalue problems for the de Rham complex on varying three‐dimensional domains. Our analysis includes the Helmholtz equation as well as the Maxwell system with mixed boundary conditions and non‐constant coefficients. We provide Hadamard‐type formulas for the shape derivatives under weak regularity assumptions on the domain and its ...
Pier Domenico Lamberti +2 more
wiley +1 more source
Area Law for the Entanglement Entropy of Free Fermions in Nonrandom Ergodic Field. [PDF]
Pastur L, Shamis M.
europepmc +1 more source
A simple planning problem for COVID-19 lockdown: a dynamic programming approach. [PDF]
Calvia A, Gozzi F, Lippi F, Zanco G.
europepmc +1 more source
PID‐Like Robust Control of Non‐Minimum Phase Robotic Manipulators
ABSTRACT This paper proposes an output‐feedback tracking controller for non‐minimum phase nonlinear systems with unknown uncertainties and external disturbances, where not all states are measurable, and the zero dynamics are unstable. The approach combines a backstepping‐based stabilizing state‐feedback law with a cascade extended high‐gain observer ...
Mohammad Al Saaideh +2 more
wiley +1 more source
Kolmogorov GAM Networks Are All You Need! [PDF]
Polson S, Sokolov V.
europepmc +1 more source
Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method. [PDF]
Doikov N, Nesterov Y.
europepmc +1 more source
A simple uniformly optimal method without line search for convex optimization
Line search (or backtracking) procedures have been widely employed into first-order methods for solving convex optimization problems, especially those with unknown problem parameters (e.g., Lipschitz constant).
Lan, Guanghui, Li, Tianjiao
core
ABSTRACT A newly developed robust control strategy based on an adaptive neural network (ANN) estimator performed in concert with adaptive super‐twisting (ASTW) control is presented. The proposed adaptive robust control algorithm is applied to a class of perturbed nonlinear systems and features a significantly decreased control gain with respect to the ...
Mohammad Javad Mirzaei +3 more
wiley +1 more source

