共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
Tathagata Basak 《Journal of Pure and Applied Algebra》2018,222(10):3036-3042
3.
The purpose of this note is to show a new series of examples of homogeneous ideals I in for which the containment fails. These ideals are supported on certain arrangements of lines in , which resemble Fermat configurations of points in , see [14]. All examples exhibiting the failure of the containment constructed so far have been supported on points or cones over configurations of points. Apart from providing new counterexamples, these ideals seem quite interesting on their own. 相似文献
4.
Jeong-Hyun Kang 《Discrete Mathematics》2018,341(1):96-103
The vertices of Kneser graph are the subsets of of cardinality , two vertices are adjacent if and only if they are disjoint. The square of a graph is defined on the vertex set of with two vertices adjacent if their distance in is at most 2. Z. Füredi, in 2002, proposed the problem of determining the chromatic number of the square of the Kneser graph. The first non-trivial problem arises when . It is believed that where is a constant, and yet the problem remains open. The best known upper bounds are by Kim and Park: for 1 (Kim and Park, 2014) and for (Kim and Park, 2016). In this paper, we develop a new approach to this coloring problem by employing graph homomorphisms, cartesian products of graphs, and linear congruences integrated with combinatorial arguments. These lead to , where is a constant in , depending on . 相似文献
5.
Fares Maalouf 《Journal of Pure and Applied Algebra》2018,222(5):1003-1005
We show that if k is an infinite field, then there exists a subspace of dimension , such that no nonzero member of W has infinitely many zeros. This generalizes a result from a paper by Bergman and Nahlus, and partly answers another question from the same paper. 相似文献
6.
7.
Given a nonnegative integer and a positive integer , a graph is said to be -colorable if the vertices of can be colored with colors such that every vertex has at most neighbors receiving the same color as itself. Let be the family of planar graphs without -cycles adjacent to cycles of length 3 or 5. This paper proves that everyone in is -colorable. This is the best possible in the sense that there are members in which are not -colorable. 相似文献
8.
Haiyang Zhu Lianying Miao Sheng Chen Xinzhong Lü Wenyao Song 《Discrete Mathematics》2018,341(8):2211-2219
Let be the set of all positive integers. A list assignment of a graph is a function that assigns each vertex a list for all . We say that is --choosable if there exists a function such that for all , if and are adjacent, and if and are at distance 2. The list--labeling number of is the minimum such that for every list assignment , is --choosable. We prove that if is a planar graph with girth
and its maximum degree is large enough, then . There are graphs with large enough and having . 相似文献
9.
In this paper we determine the projective unitary representations of finite dimensional Lie supergroups whose underlying Lie superalgebra is , where is a compact simple Lie superalgebra and A is a supercommutative associative (super)algebra; the crucial case is when is a Graßmann algebra. Since we are interested in projective representations, the first step consists in determining the cocycles defining the corresponding central extensions. Our second main result asserts that, if is a simple compact Lie superalgebra with , then each (projective) unitary representation of factors through a (projective) unitary representation of itself, and these are known by Jakobsen's classification. If , then we likewise reduce the classification problem to semidirect products of compact Lie groups K with a Clifford–Lie supergroup which has been studied by Carmeli, Cassinelli, Toigo and Varadarajan. 相似文献
10.
11.
12.
13.
14.
Johnson proved that if are coprime integers, then the th moment of the size of an -core is a polynomial of degree in for fixed . After that, by defining a statistic size on elements of affine Weyl group, which is preserved under the bijection between minimal coset representatives of and -cores, Thiel and Williams obtained the variance and the third moment about the mean of the size of an -core. Later, Ekhad and Zeilberger stated the first six moments about the mean of the size of an -core and the first nine moments about the mean of the size of an -core using Maple. To get the moments about the mean of the size of a self-conjugate -core, we proceed to follow the approach of Thiel and Williams, however, their approach does not seem to directly apply to the self-conjugate case. In this paper, following Johnson’s approach, by Ehrhart theory and Euler–Maclaurin theory, we prove that if are coprime integers, then the th moment about the mean of the size of a self-conjugate -core is a quasipolynomial of period 2 and degree in for fixed odd . Then, based on a bijection of Ford, Mai and Sze between self-conjugate -cores and lattice paths in rectangle and a formula of Chen, Huang and Wang on the size of self-conjugate -cores, we obtain the variance, the third moment and the fourth moment about the mean of the size of a self-conjugate -core. 相似文献
15.
In this paper, we employed lattice model to describe the three internally vertex-disjoint paths that span the vertex set of the generalized Petersen graph . We showed that the is 3-spanning connected for odd . Based on the lattice model, five amalgamated and one extension mechanisms are introduced to recursively establish the 3-spanning connectivity of the . In each amalgamated mechanism, a particular lattice trail was amalgamated with the lattice trails that was dismembered, transferred, or extended from parts of the lattice trails for , where a lattice tail is a trail in the lattice model that represents a path in . 相似文献
16.
Dave Anderson Mathieu Florence Zinovy Reichstein 《Comptes Rendus Mathematique》2013,351(23-24):871-875
Let G be a split simple group of type over a field k, and let be its Lie algebra. Answering a question of J.-L. Colliot-Thélène, B. Kunyavski?, V.L. Popov, and Z. Reichstein, we show that the function field is generated by algebraically independent elements over the field of adjoint invariants . 相似文献
17.
We study solutions of the focusing energy-critical nonlinear heat equation in . We show that solutions emanating from initial data with energy and -norm below those of the stationary solution W are global and decay to zero, via the “concentration-compactness plus rigidity” strategy of Kenig–Merle [33], [34]. First, global such solutions are shown to dissipate to zero, using a refinement of the small data theory and the -dissipation relation. Finite-time blow-up is then ruled out using the backwards-uniqueness of Escauriaza–Seregin–Sverak [17], [18] in an argument similar to that of Kenig–Koch [32] for the Navier–Stokes equations. 相似文献
18.
19.
Francesca Astengo Michael G. Cowling Bianca Di Blasio 《Journal of Functional Analysis》2019,276(1):127-147
We compute the “norm” of irreducible uniformly bounded representations of . We show that the Kunze–Stein version of the uniformly bounded representations has minimal norm in its similarity class of uniformly bounded representations. 相似文献
20.
Aysel Erey 《Discrete Mathematics》2018,341(5):1419-1431