This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept ...This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept of the degree of a polynomial system does not coincide with the usual one. The usual degenerate polynomial system of degree n+1 should be regarded as a system of degree n . Note that the definition is independent coordinate system. And, by this definition, some geometric properties concerning polynomial vector fields turn out to be evident.展开更多
In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a re...In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a repeated set,W(A) is weight of A.展开更多
We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt（G, x） = ∑in=yt（G） dr（G, i） x＇, where dr（G, i） is the cardinality of total dominating sets of...We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt（G, x） = ∑in=yt（G） dr（G, i） x＇, where dr（G, i） is the cardinality of total dominating sets of G of size i, and yt（G） is the total domination number of G. In [7] We have obtained some properties of Dt（G, x） and its coefficients. Also, we have calculated the total domination polynomials of complete graph, complete bipartite graph, join of two graphs and a graph consisting of disjoint components. In this paper, we presented for any two isomorphic graphs the total domination polynomials are same, but the converse is not true. Also, we proved that for any n vertex transitive graph of order n and for any v ∈ V（G）, dt（G, i） = 7 dt（V）（G, i）, 1 〈 i 〈 n. And, for any k-regular graph of order n, dr（G, i） = （7）, i 〉 n-k and d,（G, n-k） = （kn） - n. We have calculated the total domination polynomial of Petersen graph D,（P, x） = 10X4 ＋ 72x5 ＋ 140x6 ＋ 110x7 ＋ 45x8 ＋ [ 0x9 ＋ x10. Also, for any two vertices u and v of a k-regular graph Hwith N（u） ≠ N（v） and if Dr（G, x） = Dt（ H, x ）, then G is also a k-regular graph.展开更多
In 1998, Maschietti constructed several cyclic difference sets from monomial hyperovals. R. Evans, H.D.L. Holloman, C. Krattnthaler and Qing Xiang gave an algebraic proof of the two autocorrelation property of the rel...In 1998, Maschietti constructed several cyclic difference sets from monomial hyperovals. R. Evans, H.D.L. Holloman, C. Krattnthaler and Qing Xiang gave an algebraic proof of the two autocorrelation property of the related binary sequence. In this paper, we show that hyperovals are very closely related to two-to-one maps, and then we proceed to generalize Maschietti＇s result.展开更多
Partly linear regression model is useful in practice, but littleis investigated in the literature to adapt it to the real data which are dependent and conditionally heteroscedastic. In this paper, the estimators of th...Partly linear regression model is useful in practice, but littleis investigated in the literature to adapt it to the real data which are dependent and conditionally heteroscedastic. In this paper, the estimators of the regression components are constructed via local polynomial fitting and the large sample properties are explored. Under certain mild regularities, the conditions are obtained to ensure that the estimators of the nonparametric component and its derivatives are consistent up to the convergence rates which are optimal in the i.i.d. case, and the estimator of the parametric component is root-n consistent with the same rate as for parametric model. The technique adopted in the proof differs from that used and corrects the errors in the reference by Hamilton and Truong under i.i.d. samples.展开更多
This paper presents a criterion for testing the irreducibility of a polynomial over an algebraicextension field.Using this criterion and the characteristic set method,the authors give a criterion fortesting whether ce...This paper presents a criterion for testing the irreducibility of a polynomial over an algebraicextension field.Using this criterion and the characteristic set method,the authors give a criterion fortesting whether certain difference ascending chains are strong irreducible,and as a consequence,whetherthe saturation ideals of these ascending chains are prime ideals.展开更多
The authors mainly concern the set Uf of c E C such that the power deformation z（f-（z）/z）c is univalent in the unit disk ｜z｜〈 1 for a given analytic univalent function f（z） = z ＋ a2z2 ＋ ... in the unit disk...The authors mainly concern the set Uf of c E C such that the power deformation z（f-（z）/z）c is univalent in the unit disk ｜z｜〈 1 for a given analytic univalent function f（z） = z ＋ a2z2 ＋ ... in the unit disk. It is shown that Uf is a compact, polynomially convex subset of the complex plane C unless f is the identity function. In particular, the interior of Uf is simply connected. This fact enables us to apply various versions of the X-lemma for the holomorphic family z（f（z）/z）c of injections parametrized over the interior of Uf. The necessary or sufficient conditions for Uf to contain 0 or 1 as an interior point are also given.展开更多
This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,......This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients.展开更多
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic varia...In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.展开更多
Hybrid systems are dynamical systems with interacting discrete computation and continuous physical processes, which have become more common, more indispensable, and more complicated in our modern life. Particularly, m...Hybrid systems are dynamical systems with interacting discrete computation and continuous physical processes, which have become more common, more indispensable, and more complicated in our modern life. Particularly, many of them are safety-critical, and therefore are required to meet a critical safety standard. Invariant generation plays a central role in the verification and synthesis of hybrid systems. In the previous work, the fourth author and his coauthors gave a necessary and sufficient condition for a semi-algebraic set being an invariant of a polynomial autonomous dynamical system, which gave a confirmative answer to the open problem. In addition, based on which a complete algorithm for generating all semi-algebraic invariants of a given polynomial autonomous hybrid system with the given shape was proposed. This paper considers how to extend their work to non-autonomous dynamical and hybrid systems. Non-autonomous dynamical and hybrid systems are with inputs, which are very common in practice; in contrast, autonomous ones are without inputs. Furthermore, the authors present a sound and complete algorithm to verify semi-algebraic invariants for non-autonomous polynomial hybrid systems. Based on which, the authors propose a sound and complete algorithm to generate all invariants with a pre-defined template.展开更多
We obtain solutions of the nonlinear Klein-Gordon equation using a novel operational method combined with the Adomian polynomial expansion of nonlinear functions. Our operational method does not use any integral trans...We obtain solutions of the nonlinear Klein-Gordon equation using a novel operational method combined with the Adomian polynomial expansion of nonlinear functions. Our operational method does not use any integral transforms nor integration processes. We illustrate the application of our method by solving several examples and present numerical results that show the accuracy of the truncated series approximations to the solutions.展开更多
By means of the Branner-Hubbard puzzle, the author studies the topology of filled-in Julia sets for geometrically finite polynomials,and proves a conjecture of C. McMullen and a conjecture of B. Branner and J. H. Hu...By means of the Branner-Hubbard puzzle, the author studies the topology of filled-in Julia sets for geometrically finite polynomials,and proves a conjecture of C. McMullen and a conjecture of B. Branner and J. H. Hubbard partially.展开更多
文摘This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept of the degree of a polynomial system does not coincide with the usual one. The usual degenerate polynomial system of degree n+1 should be regarded as a system of degree n . Note that the definition is independent coordinate system. And, by this definition, some geometric properties concerning polynomial vector fields turn out to be evident.
文摘In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a repeated set,W(A) is weight of A.
文摘We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt（G, x） = ∑in=yt（G） dr（G, i） x＇, where dr（G, i） is the cardinality of total dominating sets of G of size i, and yt（G） is the total domination number of G. In [7] We have obtained some properties of Dt（G, x） and its coefficients. Also, we have calculated the total domination polynomials of complete graph, complete bipartite graph, join of two graphs and a graph consisting of disjoint components. In this paper, we presented for any two isomorphic graphs the total domination polynomials are same, but the converse is not true. Also, we proved that for any n vertex transitive graph of order n and for any v ∈ V（G）, dt（G, i） = 7 dt（V）（G, i）, 1 〈 i 〈 n. And, for any k-regular graph of order n, dr（G, i） = （7）, i 〉 n-k and d,（G, n-k） = （kn） - n. We have calculated the total domination polynomial of Petersen graph D,（P, x） = 10X4 ＋ 72x5 ＋ 140x6 ＋ 110x7 ＋ 45x8 ＋ [ 0x9 ＋ x10. Also, for any two vertices u and v of a k-regular graph Hwith N（u） ≠ N（v） and if Dr（G, x） = Dt（ H, x ）, then G is also a k-regular graph.
文摘In 1998, Maschietti constructed several cyclic difference sets from monomial hyperovals. R. Evans, H.D.L. Holloman, C. Krattnthaler and Qing Xiang gave an algebraic proof of the two autocorrelation property of the related binary sequence. In this paper, we show that hyperovals are very closely related to two-to-one maps, and then we proceed to generalize Maschietti＇s result.
基金This work was partially supported by the National Natural Science Foundation of China (Grant No.79930900) the Belgian Government's "Projet d'Actions de Recherche Concertees" (PARC No. 93/98-164) China Educational Ministry's Research Fund for Retur
文摘Partly linear regression model is useful in practice, but littleis investigated in the literature to adapt it to the real data which are dependent and conditionally heteroscedastic. In this paper, the estimators of the regression components are constructed via local polynomial fitting and the large sample properties are explored. Under certain mild regularities, the conditions are obtained to ensure that the estimators of the nonparametric component and its derivatives are consistent up to the convergence rates which are optimal in the i.i.d. case, and the estimator of the parametric component is root-n consistent with the same rate as for parametric model. The technique adopted in the proof differs from that used and corrects the errors in the reference by Hamilton and Truong under i.i.d. samples.
基金supported by a National Key Basic Research Project of ChinaNSFC
文摘This paper presents a criterion for testing the irreducibility of a polynomial over an algebraicextension field.Using this criterion and the characteristic set method,the authors give a criterion fortesting whether certain difference ascending chains are strong irreducible,and as a consequence,whetherthe saturation ideals of these ascending chains are prime ideals.
基金Project supported by Yeungnam University(2011)(No.211A380226)the JSPS Grant-in-Aid forScientific Research(B)(No.22340025)
文摘The authors mainly concern the set Uf of c E C such that the power deformation z（f-（z）/z）c is univalent in the unit disk ｜z｜〈 1 for a given analytic univalent function f（z） = z ＋ a2z2 ＋ ... in the unit disk. It is shown that Uf is a compact, polynomially convex subset of the complex plane C unless f is the identity function. In particular, the interior of Uf is simply connected. This fact enables us to apply various versions of the X-lemma for the holomorphic family z（f（z）/z）c of injections parametrized over the interior of Uf. The necessary or sufficient conditions for Uf to contain 0 or 1 as an interior point are also given.
基金supported by National Natural Science Foundation of China(Grant No.11161034)
文摘This paper investigates the equality-constrained minimization of polynomial functions. Let R be the field of real numbers, and R[x1,..., xn] the ring of polynomials over R in variables x1,..., xn. For an f ∈ R[x1,..., xn] and a finite subset H of R[x1,..., xn], denote by V(f : H) the set {f( ˉα) | ˉα∈ Rn, and h( ˉα) =0, ? h ∈ H}. We provide an effective algorithm for computing a finite set U of non-zero univariate polynomials such that the infimum inf V(f : H) of V(f : H) is a root of some polynomial in U whenever inf V(f : H) = ±∞.The strategies of this paper are decomposing a finite set of polynomials into triangular chains of polynomials and computing the so-called revised resultants. With the aid of the computer algebraic system Maple, our algorithm has been made into a general program to treat the equality-constrained minimization of polynomials with rational coefficients.
基金supported by the National Natural Science Foundation of China under Grant No.60821002the National Key Basic Research Project of China
文摘In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.
基金supported partly by“973 Program”under Grant No.2014CB340701by the National Natural Science Foundation of China under Grant Nos.61625205,91418204 and 61625206+2 种基金by CDZ Project CAP(GZ 1023)by the CAS/SAFEA International Partnership Program for Creative Research Teamssupported partly by the National Natural Science Foundation of China under Grant Nos.11290141,11271034 and 61532019
文摘Hybrid systems are dynamical systems with interacting discrete computation and continuous physical processes, which have become more common, more indispensable, and more complicated in our modern life. Particularly, many of them are safety-critical, and therefore are required to meet a critical safety standard. Invariant generation plays a central role in the verification and synthesis of hybrid systems. In the previous work, the fourth author and his coauthors gave a necessary and sufficient condition for a semi-algebraic set being an invariant of a polynomial autonomous dynamical system, which gave a confirmative answer to the open problem. In addition, based on which a complete algorithm for generating all semi-algebraic invariants of a given polynomial autonomous hybrid system with the given shape was proposed. This paper considers how to extend their work to non-autonomous dynamical and hybrid systems. Non-autonomous dynamical and hybrid systems are with inputs, which are very common in practice; in contrast, autonomous ones are without inputs. Furthermore, the authors present a sound and complete algorithm to verify semi-algebraic invariants for non-autonomous polynomial hybrid systems. Based on which, the authors propose a sound and complete algorithm to generate all invariants with a pre-defined template.
基金Supported by Grant SEP-CONACYT 220603SEP-PRODEP through the project UAM-PTC-630Portuguese National Funds through the FCT Foundation for Science and Technology under the project PEst-UID/EEA/00066/2013
文摘We obtain solutions of the nonlinear Klein-Gordon equation using a novel operational method combined with the Adomian polynomial expansion of nonlinear functions. Our operational method does not use any integral transforms nor integration processes. We illustrate the application of our method by solving several examples and present numerical results that show the accuracy of the truncated series approximations to the solutions.
文摘By means of the Branner-Hubbard puzzle, the author studies the topology of filled-in Julia sets for geometrically finite polynomials,and proves a conjecture of C. McMullen and a conjecture of B. Branner and J. H. Hubbard partially.
