نتایج جستجو برای: strongly zg regular
تعداد نتایج: 336559 فیلتر نتایج به سال:
Let V be a real finite dimensional representation of a compact Lie group G. It is well-known that the algebra R[V ] of G-invariant polynomials on V is finitely generated, say by σ1, . . . , σp. Schwarz [38] proved that each G-invariant C-function f on V has the form f = F (σ1, . . . , σp) for a Cfunction F on R. We investigate this representation within the framework of Denjoy–Carleman classes....
The group PGL(2, q) has an embedding into PGL(3, q) such that it acts as the group fixing a nonsingular conic in PG(2, q). This action affords a coherent configuration R(q) on the set L(q) of non-tangent lines of the conic. We show that the relations can be described by using the cross-ratio. Our results imply that the restrictions R+(q) and R−(q) of R(q) to the set L+(q) of secant (hyperbolic)...
Abstract In this paper, we use a robust lower directional derivative and provide some sufficient conditions to ensure the strong regularity of given mapping at certain point. Then, discuss Hoffman estimation achieve results for estimate distance set solutions system linear equalities . The advantage our is that it allows one calculate coefficient error bound.
In this paper, we consider a generalization of Ebenbauer’s differential equation for non-symmetric matrix diagonalization to a flow on arbitrary complex semisimple Lie algebras. The flow is designed in such a way that the desired diagonalizations are precisely the equilibrium points in a given Cartan subalgebra. We characterize the set of all equilibria and establish a Morse-Bott type property ...
A subset of the vertex set of a graph G, S ⊆ V (G), is a (k, τ)-regular set if it induces a k-regular subgraph of G and every vertex not in the subset has τ neighbors in it. This paper is a contribution to the given problem of existence of (k, τ)-regular sets associated with all distinct eigenvalues of integral strongly regular graphs. The minimal idempotents of the Bose-Mesner algebra of stron...
We survey the relationships between two-weight linear [n, k] codes over GF(q), projective (n, k, /»„ /»,) sets in PG(£— \,q), and certain strongly regular graphs. We also describe and tabulate essentially all the known examples.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید