Results 161 to 170 of about 3,009,670 (368)
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk +2 more
wiley +1 more source
Modular intersections, time interval algebras and emergent AdS2
We compute the modular flow and conjugation of time interval algebras of conformal Generalized Free Fields (GFF) in 0 + 1-dimensions in the vacuum. For non-integer scaling dimensions, for general time intervals, the modular conjugation and the modular ...
Nima Lashkari +3 more
doaj +1 more source
Hurwitz moduli varieties parameterizing pointed covers of an algebraic curve with a fixed monodromy group [PDF]
Vassil Kanev
openalex +1 more source
The existence of c-covers of Lie algebras [PDF]
Mohammad Reza Rismanchian
openalex +1 more source
Rees algebras and polyhedral cones of ideals of vertex covers of perfect\n graphs [PDF]
Rafael H. Villarreal
openalex +1 more source
Types in reductive p-adic groups: The Hecke algebra of a cover
C. Bushnell, P. Kutzko
semanticscholar +1 more source
Ensemble Kalman filters (EnKFs) with quality control (QC) are commonly used in the data assimilation (DA) of all‐sky satellite‐sensed infrared radiance (IR) observations. However, the statistical assumptions underlying EnKFs and QC are violated in such DA.
Man‐Yau Chan
wiley +1 more source
Quantum algorithms for differential equations are developed with applications in computational fluid dynamics. The methods follow an iterative simulation framework, implementing Jacobi and Gauss–Seidel schemes on quantum registers through linear combinations of unitaries.
Chelsea A. Williams +4 more
wiley +1 more source
Weak Bruhat Interval Modules of Finite-Type $0$-Hecke Algebras and Projective Covers [PDF]
Joshua Bardwell, Dominic Searles
openalex +1 more source
Event‐Triggered Saturating Control for Synchronization of Lur'e Type Complex Dynamic Networks
ABSTRACT This article addresses the problem of synchronizing discrete‐time Lur'e type complex dynamic networks (CDNs) via dynamic event‐triggered control. In particular, it is considered that the control signal of each node is subject to input saturation. Using the Lyapunov Stability Theory, properties of slope‐restricted nonlinearities, and the linear
C. Lisbôa +3 more
wiley +1 more source

