Results 61 to 70 of about 452 (178)
A Review on Kinematically Redundant Parallel Mechanisms With Configurable Platforms
SmartBot, Volume 1, Issue 4, December 2025.This review systematically combs the development context and technical system of Parallel Mechanisms with Configurable Platforms (PMCPs). Furthermore, through the progressive logic of classification, analysis and application, the paper reveals how “kinematic redundancy” and “configurable platform” break through the rigid limitations of traditional ...
Chunxu Tian, Dan Zhang
wiley +1 more source
New Zealand Journal of Agricultural Research, Volume 68, Issue 6, Page 1481-1501, December 2025.ABSTRACT Full inversion tillage (FIT) at pasture renewal is a management option aiming to increase carbon stocks in long‐term pasture, to achieve carbon neutrality. This study investigated the effects of FIT on carbon and nutrient distribution in the soil profile (0–7.5, 7.5–15, 15–22.5 and 22.5–30 cm depths) as well as nutrient uptake, and subsequent ...
Yahaya Jebril Amanor +3 more
wiley +1 more source
, 2023 A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regular Neumaier Cayley graph. We also characterize Neumaier Cayley graphs with small valency at most $10$.
openaire +2 more sources
Boundary representations of locally compact hyperbolic groups
Proceedings of the London Mathematical Society, Volume 131, Issue 6, December 2025.Abstract We develop the theory of Patterson–Sullivan measures for locally compact hyperbolic groups. This theory associates to certain left‐invariant metrics on the group measures on its boundary. Next, we establish irreducibility of the resulting (unitary) Koopman representations for second countable, nonelementary, unimodular locally compact ...
Michael Glasner
wiley +1 more source
Electronic Notes in Discrete Mathematics, 2000 Abstract In this paper we investigate the class of Cayley partitionable graphs. This investigation is motivated by the Strong Perfect Graph Conjecture. Cayley partitionable graphs are Cayley Graphs which are closely related to near-factorizations of finite groups. We prove some structural properties of near-factorizations and give examples of Cayley
openaire +4 more sources
Perfect state transfer in unitary Cayley graphs over local rings [PDF]
Transactions on Combinatorics, 2014 In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph.
Yotsanan Meemark , Songpon Sriwongsa
doaj
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Discussiones Mathematicae Graph Theory, 2016 Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note,
Ganesan Ashwin
doaj +1 more source
International Journal of Robust and Nonlinear Control, Volume 35, Issue 16, Page 6636-6651, 10 November 2025.ABSTRACT We review some known bounds on the eigenvalues of a matrix and use similar techniques to derive bounds for the class of nonlinear eigenproblems and, as a special case, the eigenvalues for LTI systems with delays. We present two classes of results.
Erik I. Verriest
wiley +1 more source
Color Energy Of A Unitary Cayley Graph
Discussiones Mathematicae Graph Theory, 2014 Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al.
Adiga Chandrashekar +2 more
doaj +1 more source
Commuting Pairs in Quasigroups
Journal of Combinatorial Designs, Volume 33, Issue 11, Page 418-427, November 2025.ABSTRACT A quasigroup is a pair ( Q , ∗ ), where Q is a nonempty set and ∗ is a binary operation on Q such that for every ( a , b ) ∈ Q 2, there exists a unique ( x , y ) ∈ Q 2 such that a ∗ x = b = y ∗ a. Let ( Q , ∗ ) be a quasigroup. A pair ( x , y ) ∈ Q 2 is a commuting pair of ( Q , ∗ ) if x ∗ y = y ∗ x.
Jack Allsop, Ian M. Wanless
wiley +1 more source