共查询到20条相似文献,搜索用时 31 毫秒
1.
《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). 相似文献
2.
3.
5.
6.
Caio De Naday Hornhardt Helen Samara Dos Santos Mikhail Kochetov 《Journal of Pure and Applied Algebra》2019,223(4):1590-1616
We classify gradings by arbitrary abelian groups on the classical simple Lie superalgebras , , and on the simple associative superalgebras , , over an algebraically closed field: fine gradings up to equivalence and G-gradings, for a fixed group G, up to isomorphism. As a corollary, we also classify up to isomorphism the G-gradings on the classical Lie superalgebra that are induced from G-gradings on . In the case of Lie superalgebras, the characteristic is assumed to be 0. 相似文献
7.
《Discrete Mathematics》2022,345(8):112904
Let be the minimum integer such that every plane graph with girth g at least , minimum degree and no -paths consisting of vertices of degree 2, where , has a 3-vertex with at least t neighbors of degree 2, where .In 2015, Jendrol' and Maceková proved . Later on, Hudák et al. established , Jendrol', Maceková, Montassier, and Soták proved , and , and we recently proved that and .Thus is already known for and all t. In this paper, we prove that , , and whenever . 相似文献
8.
9.
《Discrete Mathematics》2021,344(12):112601
10.
Sanming Zhou 《Journal of Pure and Applied Algebra》2019,223(3):931-947
We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of , with connection sets and , respectively, where () is an mth primitive root of unity, A a nonzero ideal of , and ? Euler's totient function. We call them the mth cyclotomic graph and the second kind mth cyclotomic graph, and denote them by and , respectively. We give a necessary and sufficient condition for to be a perfect t-code in and a necessary condition for to be such a code in , where is an integer and D an ideal of containing A. In the case when , is known as an Eisenstein–Jacobi and Gaussian networks, respectively, and we obtain necessary conditions for to be a perfect t-code in , where with β dividing α. In the literature such conditions are known to be sufficient when and under an additional condition. We give a classification of all first kind Frobenius circulants of valency 2p and prove that they are all pth cyclotomic graphs, where p is an odd prime. Such graphs belong to a large family of Cayley graphs that are efficient for routing and gossiping. 相似文献
11.
12.
13.
Gabriele Grillo Matteo Muratori Fabio Punzo 《Journal of Differential Equations》2019,266(7):4305-4336
We consider the porous medium equation with power-type reaction terms on negatively curved Riemannian manifolds, and solutions corresponding to bounded, nonnegative and compactly supported data. If , small data give rise to global-in-time solutions while solutions associated to large data blow up in finite time. If , large data blow up at worst in infinite time, and under the stronger restriction all data give rise to solutions existing globally in time, whereas solutions corresponding to large data blow up in infinite time. The results are in several aspects significantly different from the Euclidean ones, as has to be expected since negative curvature is known to give rise to faster diffusion properties of the porous medium equation. 相似文献
14.
15.
16.
《Journal of Pure and Applied Algebra》2022,226(10):107074
For a commutative ring A we consider a related graph, , whose vertices are the unimodular rows of length 2 up to multiplication by units. We prove that is path-connected if and only if A is a -ring, in the terminology of P. M. Cohn. Furthermore, if denotes the clique complex of , we prove that is simply connected if and only if A is universal for . More precisely, our main theorem is that for any commutative ring A the fundamental group of is isomorphic to the group modulo the subgroup generated by symbols. 相似文献
17.
《Discrete Mathematics》2022,345(3):112717
A transversal set of a graph G is a set of vertices incident to all edges of G. The transversal number of G, denoted by , is the minimum cardinality of a transversal set of G. A simple graph G with no isolated vertex is called τ-critical if for every edge . For any τ-critical graph G with , it has been shown that by Erd?s and Gallai and that by Erd?s, Hajnal and Moon. Most recently, it was extended by Gyárfás and Lehel to . In this paper, we prove stronger results via spectrum. Let G be a τ-critical graph with and , and let denote the largest eigenvalue of the adjacency matrix of G. We show that with equality if and only if G is , , or , where ; and in particular, with equality if and only if G is . We then apply it to show that for any nonnegative integer r, we have and characterize all extremal graphs. This implies a pure combinatorial result that , which is stronger than Erd?s-Hajnal-Moon Theorem and Gyárfás-Lehel Theorem. We also have some other generalizations. 相似文献
18.
Let FH be a supersolvable Frobenius group with kernel F and complement H. Suppose that a finite group G admits FH as a group of automorphisms in such a manner that and is nilpotent of class c. We show that G is nilpotent of -bounded class. 相似文献
19.
《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. 相似文献
20.
We provide an entropy formulation for porous medium-type equations with a stochastic, non-linear, spatially inhomogeneous forcing. Well-posedness and -contraction is obtained in the class of entropy solutions. Our scope allows for porous medium operators for all , and Hölder continuous diffusion nonlinearity with exponent 1/2. 相似文献