Let P（G,λ） be the chromatic polynomial of a simple graph G. A graph G is chromatically unique if for any simple graph H, P（H,λ） = P（G,λ） implies that H is isomorphic to G. Many sufficient conditions guarantee...Let P（G,λ） be the chromatic polynomial of a simple graph G. A graph G is chromatically unique if for any simple graph H, P（H,λ） = P（G,λ） implies that H is isomorphic to G. Many sufficient conditions guaranteeing that some certain complete tripartite graphs are chromatically unique were obtained by many scholars. Especially, in 2003, Zou Hui-wen showed that if n 〉 1/3m2 ＋ 3/1k2 ＋ 3/1mk＋ 1/3m-1/3k＋ 3/2√m2 ＋ k2 ＋ mk, where n,k and m are non-negative integers, then the complete tripartite graph K（n - m,n,n ＋ k） is chromatically unique （or simply χ–unique）. In this paper, we prove that for any non-negative integers n,m and k, where m ≥ 2 and k ≥ 0, if n ≥ 3/1m2 ＋ 3/1k2 ＋ 3/1mk ＋ 3/1m - 3/1k ＋ 43, then the complete tripartite graph K（n - m,n,n ＋ k） is χ–unique, which is an improvement on Zou Hui-wen’s result in the case m ≥ 2 and k ≥ 0. Furthermore, we present a related conjecture.展开更多
The finite field F<sub>q</sub> has q elements, where q = p<sup>k</sup> for prime p and k∈N. Then F<sub>q</sub>[x] is a unique factorization domain and its polynomials can be b...The finite field F<sub>q</sub> has q elements, where q = p<sup>k</sup> for prime p and k∈N. Then F<sub>q</sub>[x] is a unique factorization domain and its polynomials can be bijectively associated with their unique (up to order) factorizations into irreducibles. Such a factorization for a polynomial of degree n can be viewed as conforming to a specific template if we agree that factors with higher degree will be written before those with lower degree, and factors of equal degree can be written in any order. For example, a polynomial f(x) of degree n may factor into irreducibles and be written as (a)(b)(c), where deg a ≥ deg b ≥deg c. Clearly, the various partitions of n correspond to the templates available for these canonical factorizations and we identify the templates with the possible partitions. So if f(x) is itself irreducible over F<sub>q</sub>, it would belong to the template [n], and if f(x) split over F<sub>q</sub>, it would belong to the template [n] Our goal is to calculate the cardinalities of the sets of polynomials corresponding to available templates for general q and n. With this information, we characterize the associated probabilities that a randomly selected member of F<sub>q</sub>[x] belongs to a given template. Software to facilitate the investigation of various cases is available upon request from the authors.展开更多
Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators （BEQPO＇s）I we present the analytic expression of arbitrary m...Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators （BEQPO＇s）I we present the analytic expression of arbitrary matrix elements for BEQPO＇s. As a preliminary application, we obtain the exact expressions of partition function about the boson quadratic polynomial system, matrix elements in particle-number, coordinate, and momentum representation, and P representation for the BEQPO＇s.展开更多
A partition-of-unity （PU） based ＂FE-Meshfree＂ three-node triangular element （Trig3-RPIM） was recently developed for linear elastic problems. This Trig3-RPIM element employs hybrid shape functions that combine th...A partition-of-unity （PU） based ＂FE-Meshfree＂ three-node triangular element （Trig3-RPIM） was recently developed for linear elastic problems. This Trig3-RPIM element employs hybrid shape functions that combine the shape functions of three-node triangular element （Trig3） and radial-polynomial basis functions for the purpose of synergizing the merits of both finite element method and meshfree method. Although Trig3-RPIM element is capable of obtaining higher accuracy and convergence rate than the Trig3 element and four-node iso-parametric quadrilateral element without adding extra nodes or degrees of freedom （DOFs）, the nodal stress field through Trig3-RP1M element is not continuous and extra stress smooth operations are still needed in the post processing stage. To further improve the property of Trig3-RPIM element, a new PU-based triangular element with continuous nodal stress, called Trig3-RPIMcns, is developed. Numerical examples including several linear, free vibration and forced vibration test problems, have confirmed the correctness and feasibility of the proposed Trig3-RPIMcns element.展开更多
In this note we give a rather good approximate algorithm of optimal digit-grouped partition of sequences, showing that the optimal complete digit-grouped partition number of a dumbbell type sequence S is equal to its ...In this note we give a rather good approximate algorithm of optimal digit-grouped partition of sequences, showing that the optimal complete digit-grouped partition number of a dumbbell type sequence S is equal to its optimal digit-grouped partition number N(S), hence an estimation of N(S) is obtained. The thickness of a sequence introduced in this note is a key.展开更多
In this paper, using the properties of chromatic polynomial, we discuss the color-partition of the complement of lK 1∪(∪C u i),and characterize the graph with the same color-partition as the class graph under u...In this paper, using the properties of chromatic polynomial, we discuss the color-partition of the complement of lK 1∪(∪C u i),and characterize the graph with the same color-partition as the class graph under u i≠4k+2.展开更多
基金Supported by the National Natural Science Foundation of China (Grant No.10771091)the Science and Research Project of the Education Department of Gansu Province (Grant No.0501-02)
文摘Let P（G,λ） be the chromatic polynomial of a simple graph G. A graph G is chromatically unique if for any simple graph H, P（H,λ） = P（G,λ） implies that H is isomorphic to G. Many sufficient conditions guaranteeing that some certain complete tripartite graphs are chromatically unique were obtained by many scholars. Especially, in 2003, Zou Hui-wen showed that if n 〉 1/3m2 ＋ 3/1k2 ＋ 3/1mk＋ 1/3m-1/3k＋ 3/2√m2 ＋ k2 ＋ mk, where n,k and m are non-negative integers, then the complete tripartite graph K（n - m,n,n ＋ k） is chromatically unique （or simply χ–unique）. In this paper, we prove that for any non-negative integers n,m and k, where m ≥ 2 and k ≥ 0, if n ≥ 3/1m2 ＋ 3/1k2 ＋ 3/1mk ＋ 3/1m - 3/1k ＋ 43, then the complete tripartite graph K（n - m,n,n ＋ k） is χ–unique, which is an improvement on Zou Hui-wen’s result in the case m ≥ 2 and k ≥ 0. Furthermore, we present a related conjecture.
文摘The finite field F<sub>q</sub> has q elements, where q = p<sup>k</sup> for prime p and k∈N. Then F<sub>q</sub>[x] is a unique factorization domain and its polynomials can be bijectively associated with their unique (up to order) factorizations into irreducibles. Such a factorization for a polynomial of degree n can be viewed as conforming to a specific template if we agree that factors with higher degree will be written before those with lower degree, and factors of equal degree can be written in any order. For example, a polynomial f(x) of degree n may factor into irreducibles and be written as (a)(b)(c), where deg a ≥ deg b ≥deg c. Clearly, the various partitions of n correspond to the templates available for these canonical factorizations and we identify the templates with the possible partitions. So if f(x) is itself irreducible over F<sub>q</sub>, it would belong to the template [n], and if f(x) split over F<sub>q</sub>, it would belong to the template [n] Our goal is to calculate the cardinalities of the sets of polynomials corresponding to available templates for general q and n. With this information, we characterize the associated probabilities that a randomly selected member of F<sub>q</sub>[x] belongs to a given template. Software to facilitate the investigation of various cases is available upon request from the authors.
基金The authors would like to thank Prof. Y.D. Zhang for selfless helps and valuable discussions.
文摘Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators （BEQPO＇s）I we present the analytic expression of arbitrary matrix elements for BEQPO＇s. As a preliminary application, we obtain the exact expressions of partition function about the boson quadratic polynomial system, matrix elements in particle-number, coordinate, and momentum representation, and P representation for the BEQPO＇s.
基金the National Natural Science Foundation of China(Grant Nos.51609240,11572009&51538001)and the National Basic Research Program of China(Grant No.2014CB047100)
文摘A partition-of-unity （PU） based ＂FE-Meshfree＂ three-node triangular element （Trig3-RPIM） was recently developed for linear elastic problems. This Trig3-RPIM element employs hybrid shape functions that combine the shape functions of three-node triangular element （Trig3） and radial-polynomial basis functions for the purpose of synergizing the merits of both finite element method and meshfree method. Although Trig3-RPIM element is capable of obtaining higher accuracy and convergence rate than the Trig3 element and four-node iso-parametric quadrilateral element without adding extra nodes or degrees of freedom （DOFs）, the nodal stress field through Trig3-RP1M element is not continuous and extra stress smooth operations are still needed in the post processing stage. To further improve the property of Trig3-RPIM element, a new PU-based triangular element with continuous nodal stress, called Trig3-RPIMcns, is developed. Numerical examples including several linear, free vibration and forced vibration test problems, have confirmed the correctness and feasibility of the proposed Trig3-RPIMcns element.
文摘In this note we give a rather good approximate algorithm of optimal digit-grouped partition of sequences, showing that the optimal complete digit-grouped partition number of a dumbbell type sequence S is equal to its optimal digit-grouped partition number N(S), hence an estimation of N(S) is obtained. The thickness of a sequence introduced in this note is a key.
文摘In this paper, using the properties of chromatic polynomial, we discuss the color-partition of the complement of lK 1∪(∪C u i),and characterize the graph with the same color-partition as the class graph under u i≠4k+2.
