共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
We classify the central simple finite-dimensional noncommutative Jordan superalgebras over an algebraically closed field of characteristic . The case of characteristic 0 was considered by the authors in the previous paper [21]. In particular, we describe Leibniz brackets on all finite dimensional central simple Jordan superalgebras except mixed (nor vector neither Poisson) Kantor doubles of the supercommutative superalgebra . 相似文献
3.
《Discrete Mathematics》2021,344(12):112600
An -colored-mixed graph is a graph having m colors of arcs and n colors of edges. We do not allow two arcs or edges to have the same endpoints. A homomorphism from an -colored-mixed graph G to another -colored-mixed graph H is a morphism such that each edge (resp. arc) of G is mapped to an edge (resp. arc) of H of the same color (and orientation). An -colored-mixed graph T is said to be -universal if every graph in (the planar -colored-mixed graphs with girth at least g) admits a homomorphism to T.We show that planar -universal graphs do not exist for (and any value of g) and find a minimal (in the number vertices) planar -universal graphs in the other cases. 相似文献
5.
《Discrete Mathematics》2022,345(5):112786
Let G be a connected graph with vertices and edges. The nullity of G, denoted by , is the multiplicity of eigenvalue zero of the adjacency matrix of G. Ma, Wong and Tian (2016) proved that unless G is a cycle of order a multiple of 4, where is the elementary cyclic number of G and is the number of leaves of G. Recently, Chang, Chang and Zheng (2020) characterized the leaf-free graphs with nullity , thus leaving the problem to characterize connected graphs G with nullity when . In this paper, we solve this problem completely. 相似文献
6.
《Discrete Mathematics》2022,345(7):112866
Let G be a graph with n vertices. A path decomposition of G is a set of edge-disjoint paths containing all the edges of G. Let denote the minimum number of paths needed in a path decomposition of G. Gallai Conjecture asserts that if G is connected, then . If G is allowed to be disconnected, then the upper bound for was obtained by Donald [7], which was improved to independently by Dean and Kouider [6] and Yan [14]. For graphs consisting of vertex-disjoint triangles, is reached and so this bound is tight. If triangles are forbidden in G, then can be derived from the result of Harding and McGuinness [11], where g denotes the girth of G. In this paper, we also focus on triangle-free graphs and prove that , which improves the above result with . 相似文献
8.
We characterize all finite metabelian 2-groups G whose abelianizations are of type , with , and for which their commutator subgroups have . This is given in terms of the order of the abelianizations of the maximal subgroups and the structure of the abelianizations of those normal subgroups of index 4 in G. We then translate these group theoretic properties to give a characterization of number fields k with 2-class group , , such that the rank of where is the Hilbert 2-class field of k. In particular, we apply all this to real quadratic number fields whose discriminants are a sum of two squares. 相似文献
9.
Some cases of the LFED Conjecture, proposed by the second author [15], for certain integral domains are proved. In particular, the LFED Conjecture is completely established for the field of fractions of the polynomial algebra , the formal power series algebra and the Laurent formal power series algebra , where denotes n commutative free variables and k a field of characteristic zero. Furthermore, the relation between the LFED Conjecture and the Duistermaat–van der Kallen Theorem [3] is also discussed and emphasized. 相似文献
10.
Nursel Erey 《Journal of Pure and Applied Algebra》2019,223(7):3071-3080
Let G be a -free graph with edge ideal . We show that has linear resolution for every . Also, we show that every power of the vertex cover ideal of G has linear quotients. As a result, we describe the Castelnuovo–Mumford regularity of powers of in terms of the maximum degree of G. 相似文献
11.
12.
《Journal of Pure and Applied Algebra》2019,223(11):5030-5048
Take positive integers m, n and d. Let Y be an m-fold cyclic cover of ramified over a general hypersurface of degree md. In this paper we study the space of lines in Y and show that it is smooth of dimension if and . When , our result gives a formula on the number of m-contact order lines of X (see Definition 1.2). 相似文献
13.
Samuel Boissière Chiara Camere Alessandra Sarti 《Journal of Pure and Applied Algebra》2019,223(3):1123-1138
We describe periods of irreducible holomorphic symplectic manifolds of -type with a non-symplectic automorphism of prime order . These turn out to lie on complex ball quotients and we are able to give a precise characterization of when the period map is bijective by introducing the notion of -generality. 相似文献
14.
15.
《Discrete Mathematics》2022,345(11):113023
Let Γ be a graph with vertex set V, and let a and b be nonnegative integers. A subset C of V is called an -regular set in Γ if every vertex in C has exactly a neighbors in C and every vertex in has exactly b neighbors in C. In particular, -regular sets and -regular sets in Γ are called perfect codes and total perfect codes in Γ, respectively. A subset C of a group G is said to be an -regular set of G if there exists a Cayley graph of G which admits C as an -regular set. In this paper we prove that, for any generalized dihedral group G or any group G of order 4p or pq for some primes p and q, if a nontrivial subgroup H of G is a -regular set of G, then it must also be an -regular set of G for any and such that a is even when is odd. A similar result involving -regular sets of such groups is also obtained in the paper. 相似文献
16.
Let p be an odd prime number. We describe the Whitehead group of all extra-special and almost extra-special p-groups. For this we compute, for any finite p-group P, the subgroup of , in terms of a genetic basis of P. We also introduce a deflation map , for a normal subgroup N of P, and show that it is always surjective. Along the way, we give a new proof of the result describing the structure of , when P is an elementary abelian p-group. 相似文献
17.
18.
19.
《Discrete Mathematics》2021,344(12):112604
A well-known theorem of Vizing states that if G is a simple graph with maximum degree Δ, then the chromatic index of G is Δ or . A graph G is class 1 if , and class 2 if ; G is Δ-critical if it is connected, class 2 and for every . A long-standing conjecture of Vizing from 1968 states that every Δ-critical graph on n vertices has at least edges. We initiate the study of determining the minimum number of edges of class 1 graphs G, in addition, for every . Such graphs have intimate relation to -co-critical graphs, where a non-complete graph G is -co-critical if there exists a k-coloring of such that G does not contain a monochromatic copy of but every k-coloring of contains a monochromatic copy of for every . We use the bound on the size of the aforementioned class 1 graphs to study the minimum number of edges over all -co-critical graphs. We prove that if G is a -co-critical graph on vertices, then where ε is the remainder of when divided by 2. This bound is best possible for all and . 相似文献
20.
《Discrete Mathematics》2022,345(8):112902
For a simple graph G, denote by n, , and its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if and for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that must be edge-chromatic critical if , and they verified this when . In this paper, we prove it for . 相似文献