Results 31 to 40 of about 146 (131)
This paper investigates the robust model reference tracking control problem for high‐order descriptor linear systems (HODLS) subject to norm‐bounded parameter uncertainties.
Ya‐Jun Gao, Guang‐Ren Duan
doaj +1 more source
In recent years, with the growing interest in the Internet of Things (IoT) and decarbonization, energy harvesting has been attracting attention. Energy harvesting is a technology that converts ambient energy such as light, heat, and vibration into ...
Ryusei Shimane +2 more
doaj +1 more source
Moiré Folded Helical States at the Interfaces of Heterostructures
This manuscript explores a minimal ladder model of a graphene‐topological‐insulator heterostructure where moiré superlattices modulate Rashba spin‐orbit coupling. The study reveals that SOC lifs spin degeneracy, halves spectral periodicity, and induces “helicity fragmentation” across moiré minibands.
Paula Mellado
wiley +1 more source
Sylow subgroups and the number of irreducible characters of degrees divisible by a prime p$p$
Abstract Let G$G$ be a finite group and p$p$ be a prime. We establish an upper bound for the derived length of a Sylow p$p$‐subgroup of G$G$ in terms of the number of irreducible characters of G$G$ whose degrees are divisible by p$p$. We also prove that if B$B$ is a p$p$‐block of a finite p$p$‐solvable group G$G$ with defect group D$D$, then the ...
James P. Cossey +3 more
wiley +1 more source
Abelian threefolds with imaginary multiplication
Abstract Let A$A$ be an abelian threefold defined over a number field K$K$ with potential multiplication by an imaginary quadratic field M$M$. Under mild assumptions on K$K$, if A$A$ has signature (2,1) and the multiplication by M$M$ is defined over KM$KM$, we attach to A$A$ an elliptic curve defined over K$K$ with potential complex multiplication by M$
Francesc Fité, Pip Goodman
wiley +1 more source
Random Diophantine equations in the primes
Abstract We consider equations of the form a1x1k+⋯+asxsk=0$a_{1}x_{1}^{k}+\cdots +a_{s}x_{s}^{k}=0$ where the variables xi$x_{i}$ are all taken to be primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever k⩾2$k\geqslant 2$, s⩾3k+2$s\geqslant 3k+2$, this holds
Philippa Holdridge
wiley +1 more source
ABSTRACT This work addresses the challenge of bidirectional trajectory tracking in solar‐powered wheeled mobile robots (WMRs), considering the mechanical structure, actuator‐driver, and power stage subsystems. Notably, this is the first study to explicitly model and control the actuator‐driver subsystem within this context. The proposed solution relies
Benjamin Natanael Santiago‐Nogales +8 more
wiley +1 more source
Abstract Let F$F$ be a non‐Archimedean local field with odd characteristic p$p$. Let N$N$ be a positive integer and G=Sp2N(F)$G=\operatorname{Sp}_{2N}(F)$. By work of Lomelí on γ$\gamma$‐factors of pairs and converse theorems, a generic supercuspidal representation π$\pi$ of G$G$ has a transfer to a smooth irreducible representation Ππ$\Pi _\pi$ of ...
Corinne Blondel +2 more
wiley +1 more source
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
Abstract We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to 1. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre‐like bound holds with equality for weighted
Jade Nardi, Rodrigo San‐José
wiley +1 more source
The N‐prime graph and the Subgroup Isomorphism Problem
Abstract We introduce a directed graph related to a group G$G$, which we call the N‐prime graph ΓN(G)$\Gamma _{\rm {N}}(G)$ of G$G$ and is a refinement of the classical Gruenberg–Kegel graph. The vertices of ΓN(G)$\Gamma _{\rm {N}}(G)$ are the primes p$p$ such that G$G$ has an element of order p$p$, and, for distinct vertices p$p$ and q$q$, the arc q→p$
Emanuele Pacifici +2 more
wiley +1 more source

