scholarly journals A generating set for the canonical ideal of HKG-curves

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Aristides Kontogeorgis ◽  
Ioannis Tsouknidas
Keyword(s):  
Generating Set ◽  
Canonical Ideal

A Control System for a High-Quality Generating Set Equipped With a Two-Shaft Gas Turbine

1991 ◽  
Vol 113 (2) ◽  
pp. 290-295 ◽  
Author(s):  
H. Kumakura ◽  
T. Matsumura ◽  
E. Tsuruta ◽  
A. Watanabe
Keyword(s):  
Control System ◽  
Gas Turbine ◽  
Gas Turbines ◽  
High Quality ◽  
Constant Frequency ◽  
Generating Set ◽  
Generating Sets ◽  
Power Turbine ◽  
Computer Centers ◽  
Supply Systems

A control system has been developed for a high-quality generating set (150-kW) equipped with a two-shaft gas turbine featuring a variable power turbine nozzle. Because this generating set satisfies stringent frequency stability requirements, it can be employed as the direct electric power source for computer centers without using constant-voltage, constant-frequency power supply systems. Conventional generating sets of this kind have normally been powered by single-shaft gas turbines, which have a larger output shaft inertia than the two-shaft version. Good frequency characteristics have also been realized with the two-shaft gas turbine, which provides superior quick start ability and lower fuel consumption under partial loads.

scholarly journals Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains

2014 ◽  
Vol 23 (4) ◽  
pp. 585-606
Author(s):  
RAVI MONTENEGRO
Keyword(s):  
Markov Chains ◽  
Cayley Graph ◽  
Mixing Time ◽  
Symmetric Case ◽  
Generating Set ◽  
Finite Markov Chains

We extend the conductance and canonical paths methods to the setting of general finite Markov chains, including non-reversible non-lazy walks. The new path method is used to show that a known bound for the mixing time of a lazy walk on a Cayley graph with a symmetric generating set also applies to the non-lazy non-symmetric case, often even when there is no holding probability.

A Note on Parabolic Subgroups and the Steenrod Algebra Action

2008 ◽  
Vol 15 (04) ◽  
pp. 689-698
Author(s):  
Nondas E. Kechagias
Keyword(s):  
Steenrod Algebra ◽  
Parabolic Subgroups ◽  
Generating Set ◽  
Modular Invariants ◽  
Dickson Algebra

The ring of modular invariants of parabolic subgroups has been described by Kuhn and Mitchell using Dickson algebra generators. We provide a new generating set which is closed under the Steenrod algebra action along with the relations between these elements.

A new method for automatically identifying the shaft orbit moving direction of hydroelectric generating set

Sensor Review ◽  
2010 ◽  
Vol 30 (3) ◽  
pp. 197-203 ◽  
Author(s):  
Zhimeng Luo ◽  
Jianzhong Zhou ◽  
Xiuqiao Xiang ◽  
Yaoyao He ◽  
Shan Peng
Keyword(s):  
New Method ◽  
Generating Set ◽  
Moving Direction

scholarly journals Automorphisms of higher rank lamplighter groups

2015 ◽  
Vol 25 (08) ◽  
pp. 1275-1299 ◽  
Author(s):  
Melanie Stein ◽  
Jennifer Taback ◽  
Peter Wong
Keyword(s):  
Cayley Graph ◽  
Infinite Number ◽  
Conjugacy Classes ◽  
Generating Set ◽  
Twisted Conjugacy ◽  
Higher Rank ◽  
Lamplighter Groups

Let [Formula: see text] denote the group whose Cayley graph with respect to a particular generating set is the Diestel–Leader graph [Formula: see text], as described by Bartholdi, Neuhauser and Woess. We compute both [Formula: see text] and [Formula: see text] for [Formula: see text], and apply our results to count twisted conjugacy classes in these groups when [Formula: see text]. Specifically, we show that when [Formula: see text], the groups [Formula: see text] have property [Formula: see text], that is, every automorphism has an infinite number of twisted conjugacy classes. In contrast, when [Formula: see text] the lamplighter groups [Formula: see text] have property [Formula: see text] if and only if [Formula: see text].

scholarly journals The Fundamental Group of Balanced Simplicial Complexes and Posets

10.37236/73 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Steven Klee
Keyword(s):  
Fundamental Group ◽  
Upper Bound ◽  
Large Family ◽  
Simplicial Complexes ◽  
Generating Set ◽  
Minimal Generating Set

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

Sign in / Sign up

Export Citation Format

Share Document