Results 61 to 70 of about 2,694 (314)
Vector bundles on bielliptic surfaces: Ulrich bundles and degree of irrationality
Abstract This paper deals with two problems about vector bundles on bielliptic surfaces. The first is to give a classification of Ulrich bundles on such surfaces S$S$, which depends on the topological type of S$S$. In doing so, we study the weak Brill–Noether property for moduli spaces of sheaves with isotropic Mukai vector. Adapting an idea of Moretti
Edoardo Mason
wiley +1 more source
Contractions of Lie algebras and algebraic groups
Degenerations, contractions and deformations of various algebraic structures play an important role in mathematics and physics. There are many different definitions and special cases of these notions. We try to give a general definition which unifies these notions and shows the connections among them.
openaire +4 more sources
Abstract Background Huntington's disease (HD) is characterized by early, selective, progressive vulnerability of striatal medium spiny neurons (MSNs). Proenkephalin (PENK), a precursor of opioid peptides abundantly expressed in MSNs, is a promising biomarker of striatal integrity, but region‐specific associations and its potential for early‐stage ...
Mena Farag +14 more
wiley +1 more source
Cosmological string backgrounds from super Poisson-Lie T-plurality
We generalize the formulation of Poisson-Lie (PL) T-plurality proposed by R. von Unge (2002) [6] from Lie groups to Lie supergroups. By taking a convenient ansatz for metric of the σ-model in terms of the left-invariant one-forms of the isometry Lie ...
Ali Eghbali
doaj +1 more source
ABSTRACT Liénard equations are analyzed using the recent theory of 𝒞∞‐structures. For each Liénard equation, a 𝒞∞‐structure is determined by using a Lie point symmetry and a 𝒞∞‐symmetry. Based on this approach, a novel method for integrating these equations is proposed, which consists in solving sequentially two completely integrable Pfaffian equations.
Beltrán de la Flor +2 more
wiley +1 more source
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
Initial State Privacy of Nonlinear Systems on Riemannian Manifolds
ABSTRACT In this paper, we investigate initial state privacy protection for discrete‐time nonlinear closed systems. By capturing Riemannian geometric structures inherent in such privacy challenges, we refine the concept of differential privacy through the introduction of an initial state adjacency set based on Riemannian distances.
Le Liu, Yu Kawano, Antai Xie, Ming Cao
wiley +1 more source
Distributed Formation Control for Heterogeneous Robot Systems Based on Competitive Mechanism
ABSTRACT This paper presents an adaptive formation control method for a heterogeneous robot swarm, utilising a multilevel formation task tree to model various types of formation tasks and a single‐state distributed k‐winner‐take‐all (S‐DKWTA) algorithm to address the MRTA problem.
Zhenghui Cui, Xiaoyi Gu, Ning Tan
wiley +1 more source
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Optimal Job Design and Information Elicitation
ABSTRACT When managers rely on their subordinates for local information but cannot commit to how such information is used, the incentives for effort and information elicitation become intertwined. This incentive problem influences the firm's job design decision, that is, whether to assign all tasks in a job to one worker (“individual assignment”) or ...
Arijit Mukherjee +2 more
wiley +1 more source

