共查询到20条相似文献,搜索用时 281 毫秒
1.
2.
3.
4.
5.
6.
8.
9.
We give some arithmetic-geometric interpretations of the moments , , and of the Sato–Tate group of an abelian variety A defined over a number field by relating them to the ranks of the endomorphism ring and Néron–Severi group of A. 相似文献
10.
《Discrete Mathematics》2022,345(10):113004
Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, can be partitioned into A and B such that is perfect and . We use and to denote a path and a cycle on t vertices, respectively. For two disjoint graphs and , we use to denote the graph with vertex set and edge set , and use to denote the graph with vertex set and edge set . In this paper, we prove that (i) -free graphs are perfectly divisible, (ii) if G is -free with , (iii) if G is -free, and (iv) if G is -free. 相似文献
11.
12.
13.
14.
Let be a Noetherian local ring and M a finitely generated R-module. The invariants and of M were introduced in [3] and [17] in order to measure the non-Cohen–Macaulayness and the non-sequential-Cohen–Macaulayness of M, respectively. Let be the filtration of M such that is the largest submodule of M of dimension less than for all and . In this paper we prove that if , then there exists a constant c such that for all good parameter ideals of M with respect to this filtration. Here is the reducibility index of on M. This is an extension of the main results of [19], [20], [24]. 相似文献
15.
16.
17.
We study the non-linear minimization problem on with , and : where presents a global minimum α at with . In order to describe the concentration of around , one needs to calibrate the behavior of with respect to s. The model case is In a previous paper dedicated to the same problem with , we showed that minimizers exist only in the range , which corresponds to a dominant non-linear term. On the contrary, the linear influence for prevented their existence. The goal of this present paper is to show that for , and , minimizers do exist. 相似文献
19.
《Discrete Mathematics》2022,345(8):112903
Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number is the least integer k for which G admits a coloring with k colors such that each color class induces a -degenerate subgraph of G. So is the chromatic number and is the point arboricity. The point partition number with was introduced by Lick and White. A graph G is called -critical if every proper subgraph H of G satisfies . In this paper we prove that if G is a -critical graph whose order satisfies , then G can be obtained from two non-empty disjoint subgraphs and by adding t edges between any pair of vertices with and . Based on this result we establish the minimum number of edges possible in a -critical graph G of order n and with , provided that and t is even. For the corresponding two results were obtained in 1963 by Tibor Gallai. 相似文献
20.
The second generalized GK function fields are a recently found family of maximal function fields over the finite field with elements, where q is a prime power and an odd integer. In this paper we construct many new maximal function fields by determining various Galois subfields of . In case and either q is even or , we find a complete list of Galois subfields of . Our construction adds several previously unknown genera to the genus spectrum of maximal curves. 相似文献