Results 71 to 80 of about 86,239 (234)
A description of a class of finite semigroups that are near to being Malcev nilpotent
, 2012 In this paper we continue the investigations on the algebraic structure of a finite semigroup $S$ that is determined by its associated upper non-nilpotent graph $\mathcal{N}_{S}$.
E. JESPERS +3 more
core +1 more source
6D RG flows and nilpotent hierarchies [PDF]
, 2016 A bstractWith the eventual aim of classifying renormalization group flows between 6D superconformal field theories (SCFTs), we study flows generated by the vevs of “conformal matter,” a generalization of conventional hypermultiplets which naturally ...
J. Heckman, Tom Rudelius, A. Tomasiello
semanticscholar +1 more source
Finite decomposition rank for virtually nilpotent groups [PDF]
Transactions of the American Mathematical Society, 2017 We show that inductive limits of virtually nilpotent groups have strongly quasidiagonal C*-algebras, extending results of the first author on solvable virtually nilpotent groups.
C. Eckhardt, E. Gillaspy, P. McKenney
semanticscholar +1 more source
On the genus of graphs from commutative rings
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a commutative ring with non-zero identity. The cozero-divisor graph of , denoted by , is a graph with vertex-set , which is the set of all non-zero non-unit elements of , and two distinct vertices and in are adjacent if and only if and , where for
S. Kavitha, R. Kala
doaj +1 more source
Journal of Algebra, 1997 Let \(N_{m,n}\) be the set of \(m\)-tuples of nilpotent \(n\times n\) matrices; this is the nullcone of the action of \(\text{GL}_n\) on \(m\)-tuples of \(n\times n\) matrices by simultaneous conjugation. The author considers the stratification of \(N_{m,n}\) arising from the work of \textit{W. Hesselink} [Invent. Math.
openaire +3 more sources
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Computing nilpotent quotients in finitely presented Lie rings [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 A nilpotent quotient algorithm for finitely presented Lie rings over Z (and Q) is described. The paper studies the graded and non-graded cases separately.
Csaba Schneider
doaj +2 more sources
The Natural Components of a Regular Linear System
Oxford Bulletin of Economics and Statistics, EarlyView.ABSTRACT The analysis of a finite‐dimensional regular linear system may be simplified by separating the system into its natural components. The natural components are smaller linear systems on separate subspaces whose dimensions sum to the dimension of the original linear system.
Brendan K. Beare, Phil Howlett
wiley +1 more source
Lifting of nilpotent contractions
, 2007 It is proved that that every nilpotent contraction in a quotient C*-algebra can be lifted to a nilpotent contraction. As a consequence we get that the universal C*-algebra generated by a nilpotent contraction is projective.
Shulman, Tatiana
core +1 more source
Nilpotent groups are round [PDF]
Israel Journal of Mathematics, 2008 We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of the group. Our main result is that this combinatorial property is equivalent to nilpotence.
Berend, Daniel, Boshernitzan, Michael D.
openaire +3 more sources