By utilizing symmetric functions,this paper presents explicit representations for Hermite interpolation and its numerical differentiation formula.And the corresponding error estimates are also provided.
In this article, we prove that the symmetric function Fn（x,r）=∑i1＋i2＋……in=r（x1（i1x2^i2……xn^in）1/r is Schur harmonic convex for x ∈ R＋n and r ∈N -=（1, 2, 3,...} As its applications, some analytic inequa...In this article, we prove that the symmetric function Fn（x,r）=∑i1＋i2＋……in=r（x1（i1x2^i2……xn^in）1/r is Schur harmonic convex for x ∈ R＋n and r ∈N -=（1, 2, 3,...} As its applications, some analytic inequalities are established.展开更多
In the present investigation, we consider two new general subclasses B∑m（T, λ; α）and B^∑m （τ λ;β） of Em consisting of analytic and m-fold symmetric bi-univalent functions in the open unit disk U. For functi...In the present investigation, we consider two new general subclasses B∑m（T, λ; α）and B^∑m （τ λ;β） of Em consisting of analytic and m-fold symmetric bi-univalent functions in the open unit disk U. For functions belonging to the two classes introduced here, we derive non-sharp estimates on the initial coefficients [a-~＋ll and │a2＋1│. Several connections to some of the earlier known results are also pointed out.展开更多
respectively, where r = 1, 2, … , n, and il, i2, … , is are positive integers. In this paper, the Schur convexity of Fn（X, r） and Gn（x, r） are discussed. As applications, by a bijective transformation of indepen...respectively, where r = 1, 2, … , n, and il, i2, … , is are positive integers. In this paper, the Schur convexity of Fn（X, r） and Gn（x, r） are discussed. As applications, by a bijective transformation of independent variable for a Schur convex function, the authors obtain Schur convexity for some other symmetric functions, which subsumes the main results in recent literature; and by use of the theory of majorization establish some inequalities. In particular, the authors derive from the results of this paper the Weierstrass inequalities and the Ky Fan＇s inequality, and give a generalization of Safta＇s conjecture in the n-dimensional space and others.展开更多
Rotation symmetric function was presented by Pieprzyk. The algebraic configuration of rotation symmetric（RotS） function is special. For a Rots n variables function f（x1, x2, …, xn） we have f（ρn^k （x1, x2, …x...Rotation symmetric function was presented by Pieprzyk. The algebraic configuration of rotation symmetric（RotS） function is special. For a Rots n variables function f（x1, x2, …, xn） we have f（ρn^k （x1, x2, …xn））=f（x1, x2, …, xn） for k=0, 1, …, n-1. In this paper, useing probability method we find that when the parameters of RotS function is under circular translation of indices, its walsh spectrum is invariant. And we prove the result is both sufficient and necessary.展开更多
For an odd integer n ≥ 7, this paper presented a class of n-variable rotation symmetric Boolean functions （RSBFs） with optimum algebraic immunity. The nonlinearity of the constructed functions is determined.
In this paper, we investigate the coefficient estimate and Fekete-Szeg? inequality of a class of m-fold bi-univalent function defined by subordination. The results presented in this paper improve or generalize the rec...In this paper, we investigate the coefficient estimate and Fekete-Szeg? inequality of a class of m-fold bi-univalent function defined by subordination. The results presented in this paper improve or generalize the recent works of other authors.展开更多
In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure betwe...In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.展开更多
We construct the quantum fields presentation of the generalized universal character and the generalized B-type universal character,and by acting the quantum fields presentations to the constant 1,the generating functi...We construct the quantum fields presentation of the generalized universal character and the generalized B-type universal character,and by acting the quantum fields presentations to the constant 1,the generating functions are derived.Furthermore,we introduce two integrable systems known as the generalized UC(GUC)hierarchy and the generalized Btype UC(GBUC)hierarchy satisfied by the generalized universal character and the generalized B-type universal character,respectively.Based on infinite sequences of complex numbers,we further establish the multiparameter generalized universal character and the multiparameter generalized B-type universal character,which have been proved to be solutions of the GUC hierarchy and the GBUC hierarchy,respectively.展开更多
This paper is concerned with construction of quantum fields presentation and generating functions of symplectic Schur functions and symplectic universal characters.The boson-fermion correspondence for these symmetric ...This paper is concerned with construction of quantum fields presentation and generating functions of symplectic Schur functions and symplectic universal characters.The boson-fermion correspondence for these symmetric functions have been presented.In virtue of quantum fields,we derive a series of infinite order nonlinear integrable equations,namely,universal character hierarchy,symplectic KP hierarchy and symplectic universal character hierarchy,respectively.In addition,the solutions of these integrable systems have been discussed.展开更多
After Google reported its realization of quantum supremacy,Solving the classical problems with quantum computing is becoming a valuable research topic.Switching function minimization is an important problem in Electro...After Google reported its realization of quantum supremacy,Solving the classical problems with quantum computing is becoming a valuable research topic.Switching function minimization is an important problem in Electronic Design Automation(EDA)and logic synthesis,most of the solutions are based on heuristic algorithms with a classical computer,it is a good practice to solve this problem with a quantum processer.In this paper,we introduce a new hybrid classic quantum algorithm using Grover’s algorithm and symmetric functions to minimize small Disjoint Sum of Product(DSOP)and Sum of Product(SOP)for Boolean switching functions.Our method is based on graph partitions for arbitrary graphs to regular graphs,which can be solved by a Grover-based quantum searching algorithm we proposed.The Oracle for this quantum algorithm is built from Boolean symmetric functions and implemented with Lattice diagrams.It is shown analytically and verified by simulations on a quantum simulator that our methods can find all solutions to these problems.展开更多
In this paper,we consider the exact quantum query complexity of two fundamental symmetric functions.1)MOD_(m)^(n),which calculates the Hamming weight of an-bit string modulo;2)EXACT_(k,l)^(n),which determines if the H...In this paper,we consider the exact quantum query complexity of two fundamental symmetric functions.1)MOD_(m)^(n),which calculates the Hamming weight of an-bit string modulo;2)EXACT_(k,l)^(n),which determines if the Hamming weight of an-bit string is exactly k or l.Although these two symmetric functions have received considerable attention,their exact quantum query complexities have not been fully characterized.Specifically,our results are as follows:1)We design an optimal quantum query algorithm to compute MOD_(m)^(n)exactly and thus provide a tight characterization of its exact quantum query complexity,which settles a previous conjecture.Based on this algorithm,we demonstrate that a broad class of symmetric functions is not evasive in the quantum model,i.e.,there exist quantum algorithms to compute these functions exactly when the number of queries is less than their input size.2)By proposing a quantum algorithm that utilizes the minimum number of queries to compute EXACT_(k,l)^(n)exactly for some specific values of k and l,we give a tight characterization of its exact quantum query complexity in these scenarios.展开更多
The present work is much motivated by finding an explicit way in the construction of the Jack symmetric function,which is the spectrum generating function for the Calogero-Sutherland (CS) model.To accomplish this work...The present work is much motivated by finding an explicit way in the construction of the Jack symmetric function,which is the spectrum generating function for the Calogero-Sutherland (CS) model.To accomplish this work,the hidden Virasoro structure in the CS model is much explored.In particular,we found that the Virasoro singular vectors form a skew hierarchy in the CS model.Literally,skew is analogous to coset,but here specifically refer to the operation on the Young tableaux.In fact,based on the construction of the Virasoro singular vectors,this hierarchical structure can be used to give a complete construction of the CS states,i.e.the Jack symmetric functions,recursively.The construction is given both in operator formalism as well as in integral representation.This new integral representation for the Jack symmetric functions may shed some insights on the spectrum constructions for the other integrable systems.展开更多
In this article, by means of the theory of majorization, Adamovic's inequality is extended to the cases of the general elementary symmetric functions and its duals, and the refined and reversed forms are also give...In this article, by means of the theory of majorization, Adamovic's inequality is extended to the cases of the general elementary symmetric functions and its duals, and the refined and reversed forms are also given. As applications, some new inequalities for simplex are established.展开更多
Exponential generalizations of Newman＇s inequality and Klamkin＇s inequality are established by the Wang Wan-lan＇s inequality, and they are extended to the cases involving general elementary symmetric functions. As ...Exponential generalizations of Newman＇s inequality and Klamkin＇s inequality are established by the Wang Wan-lan＇s inequality, and they are extended to the cases involving general elementary symmetric functions. As an application, some new inequalities for a simplex are established. In addition, an open problem is posed.展开更多
The properties of the 2m-variable symmetric Boolean functions with maximum al- gebraic immunity are studied in this paper. Their value vectors, algebraic normal forms, and algebraic degrees and weights are all obtaine...The properties of the 2m-variable symmetric Boolean functions with maximum al- gebraic immunity are studied in this paper. Their value vectors, algebraic normal forms, and algebraic degrees and weights are all obtained. At last, some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.展开更多
This paper provides a systematic method on the enumeration of various permutation symmetric Boolean functions. The results play a crucial role on the search of permutation symmetric Boolean functions with good cryptog...This paper provides a systematic method on the enumeration of various permutation symmetric Boolean functions. The results play a crucial role on the search of permutation symmetric Boolean functions with good cryptographic properties. The proposed method is algebraic in nature. As a by-product, the authors correct and generalize the corresponding results of St^nic~ and Maitra （2008）. Further, the authors give a complete classification of block-symmetric bent functions based on the results of Zhao and Li （2006）, and the result is the only one classification of a certain class of permutation symmetric bent functions after the classification of symmetric bent functions proposed by Savicky （1994）.展开更多
We study bosonic tau functions in relation with the charged free bosonic fields.It is proved that up to a constant the only tau function in the Fock space M is the vacuum vector,and some tau functions are given in the...We study bosonic tau functions in relation with the charged free bosonic fields.It is proved that up to a constant the only tau function in the Fock space M is the vacuum vector,and some tau functions are given in the completion M by using Schur functions.We also give a new proof of Borchardt’s identity and obtain several q-series identities by using the boson-boson correspondence.展开更多
From the motivation of algebraic attacks on stream and block ciphers,the concept of algebraic immunity（AI） of a Boolean function was introduced and studied extensively.High algebraic immunity is a necessary conditio...From the motivation of algebraic attacks on stream and block ciphers,the concept of algebraic immunity（AI） of a Boolean function was introduced and studied extensively.High algebraic immunity is a necessary condition for resisting algebraic attacks.In this paper,we give some lower bounds on the algebraic immunity of Boolean functions.The results are applied to give lower bounds on the AI of symmetric Boolean functions and rotation symmetric Boolean functions.Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value「n/2」are constructed.展开更多
基金Supported by the Education Department of Zhejiang Province (Y200806015)
文摘By utilizing symmetric functions,this paper presents explicit representations for Hermite interpolation and its numerical differentiation formula.And the corresponding error estimates are also provided.
基金supported by NSFC (60850005)NSF of Zhejiang Province(D7080080, Y7080185, Y607128)
文摘In this article, we prove that the symmetric function Fn（x,r）=∑i1＋i2＋……in=r（x1（i1x2^i2……xn^in）1/r is Schur harmonic convex for x ∈ R＋n and r ∈N -=（1, 2, 3,...} As its applications, some analytic inequalities are established.
文摘In the present investigation, we consider two new general subclasses B∑m（T, λ; α）and B^∑m （τ λ;β） of Em consisting of analytic and m-fold symmetric bi-univalent functions in the open unit disk U. For functions belonging to the two classes introduced here, we derive non-sharp estimates on the initial coefficients [a-~＋ll and │a2＋1│. Several connections to some of the earlier known results are also pointed out.
基金supported by the National Natural Science Foundation of China(Nos.11271118,10871061,11301172)the Nature Science Foundation of Hunan Province(No.12JJ3002)+1 种基金the Scientific Research Fund of Hunan Provincial Education Department(No.11A043)the Construct Program of the Key Discipline in Hunan Province
文摘respectively, where r = 1, 2, … , n, and il, i2, … , is are positive integers. In this paper, the Schur convexity of Fn（X, r） and Gn（x, r） are discussed. As applications, by a bijective transformation of independent variable for a Schur convex function, the authors obtain Schur convexity for some other symmetric functions, which subsumes the main results in recent literature; and by use of the theory of majorization establish some inequalities. In particular, the authors derive from the results of this paper the Weierstrass inequalities and the Ky Fan＇s inequality, and give a generalization of Safta＇s conjecture in the n-dimensional space and others.
基金Supported by the National Natural ScienceFoundation of China (90104035)
文摘Rotation symmetric function was presented by Pieprzyk. The algebraic configuration of rotation symmetric（RotS） function is special. For a Rots n variables function f（x1, x2, …, xn） we have f（ρn^k （x1, x2, …xn））=f（x1, x2, …, xn） for k=0, 1, …, n-1. In this paper, useing probability method we find that when the parameters of RotS function is under circular translation of indices, its walsh spectrum is invariant. And we prove the result is both sufficient and necessary.
基金Supported by the National Natural Science Foundation of China ( 60603012)the Foundation of Hubei Provincial Department of Education, China (D200610004)
文摘For an odd integer n ≥ 7, this paper presented a class of n-variable rotation symmetric Boolean functions （RSBFs） with optimum algebraic immunity. The nonlinearity of the constructed functions is determined.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1156100111271045)+4 种基金the Program for Young Talents of Science and Technology in Universities of Inner Mongolia Autonomous Region(Grant No.NJYT-18-A14)the Natural Science Foundation of Inner Mongolia of China(Grant No.2018MS01026)the Higher School Foundation of Inner Mongolia of China(Grant No.NJZY19211)the Natural Science Foundation of Anhui Provincial Department of Education(Grant Nos.KJ2018A0833 KJ2018A0839)
文摘In this paper, we investigate the coefficient estimate and Fekete-Szeg? inequality of a class of m-fold bi-univalent function defined by subordination. The results presented in this paper improve or generalize the recent works of other authors.
基金Supported by the Natural Science Foundation of Hubei Province(2008CDZD47)
文摘In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12461048 and 12061051)the Natural Science Foundation of Inner Mongolia Autonomous Region(Grant No.2023MS01003)+2 种基金the Program for Young Talents of Science and Technology in Universities of Inner Mongolia Autonomous Region(Grant No.NJYT23096)the financial support from the Program of China Scholarships Council(Grant No.202306810054)for one year study at the University of Leedsthe support of Professor Ke Wu and Professor Weizhong Zhao at Capital Normal University,China。
文摘We construct the quantum fields presentation of the generalized universal character and the generalized B-type universal character,and by acting the quantum fields presentations to the constant 1,the generating functions are derived.Furthermore,we introduce two integrable systems known as the generalized UC(GUC)hierarchy and the generalized Btype UC(GBUC)hierarchy satisfied by the generalized universal character and the generalized B-type universal character,respectively.Based on infinite sequences of complex numbers,we further establish the multiparameter generalized universal character and the multiparameter generalized B-type universal character,which have been proved to be solutions of the GUC hierarchy and the GBUC hierarchy,respectively.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11965014 and 12061051)the National Science Foundation of Qinghai Province,China(Grant No.2021-ZJ-708)。
文摘This paper is concerned with construction of quantum fields presentation and generating functions of symplectic Schur functions and symplectic universal characters.The boson-fermion correspondence for these symmetric functions have been presented.In virtue of quantum fields,we derive a series of infinite order nonlinear integrable equations,namely,universal character hierarchy,symplectic KP hierarchy and symplectic universal character hierarchy,respectively.In addition,the solutions of these integrable systems have been discussed.
文摘After Google reported its realization of quantum supremacy,Solving the classical problems with quantum computing is becoming a valuable research topic.Switching function minimization is an important problem in Electronic Design Automation(EDA)and logic synthesis,most of the solutions are based on heuristic algorithms with a classical computer,it is a good practice to solve this problem with a quantum processer.In this paper,we introduce a new hybrid classic quantum algorithm using Grover’s algorithm and symmetric functions to minimize small Disjoint Sum of Product(DSOP)and Sum of Product(SOP)for Boolean switching functions.Our method is based on graph partitions for arbitrary graphs to regular graphs,which can be solved by a Grover-based quantum searching algorithm we proposed.The Oracle for this quantum algorithm is built from Boolean symmetric functions and implemented with Lattice diagrams.It is shown analytically and verified by simulations on a quantum simulator that our methods can find all solutions to these problems.
基金supported by the National Natural Science Foundation of China(Grant Nos.62332009,12347104,and 61972191)the Innovation Program for Quantum Science and Technology(2021ZD0302901).
文摘In this paper,we consider the exact quantum query complexity of two fundamental symmetric functions.1)MOD_(m)^(n),which calculates the Hamming weight of an-bit string modulo;2)EXACT_(k,l)^(n),which determines if the Hamming weight of an-bit string is exactly k or l.Although these two symmetric functions have received considerable attention,their exact quantum query complexities have not been fully characterized.Specifically,our results are as follows:1)We design an optimal quantum query algorithm to compute MOD_(m)^(n)exactly and thus provide a tight characterization of its exact quantum query complexity,which settles a previous conjecture.Based on this algorithm,we demonstrate that a broad class of symmetric functions is not evasive in the quantum model,i.e.,there exist quantum algorithms to compute these functions exactly when the number of queries is less than their input size.2)By proposing a quantum algorithm that utilizes the minimum number of queries to compute EXACT_(k,l)^(n)exactly for some specific values of k and l,we give a tight characterization of its exact quantum query complexity in these scenarios.
基金Supported by the Chinese Academy of Sciences Program "Frontier Topics in Mathematical Physics" (KJCX3-SYW-S03)Supported Partially by the National Natural Science Foundation of China under Grant No.11035008
文摘The present work is much motivated by finding an explicit way in the construction of the Jack symmetric function,which is the spectrum generating function for the Calogero-Sutherland (CS) model.To accomplish this work,the hidden Virasoro structure in the CS model is much explored.In particular,we found that the Virasoro singular vectors form a skew hierarchy in the CS model.Literally,skew is analogous to coset,but here specifically refer to the operation on the Young tableaux.In fact,based on the construction of the Virasoro singular vectors,this hierarchical structure can be used to give a complete construction of the CS states,i.e.the Jack symmetric functions,recursively.The construction is given both in operator formalism as well as in integral representation.This new integral representation for the Jack symmetric functions may shed some insights on the spectrum constructions for the other integrable systems.
文摘In this article, by means of the theory of majorization, Adamovic's inequality is extended to the cases of the general elementary symmetric functions and its duals, and the refined and reversed forms are also given. As applications, some new inequalities for simplex are established.
文摘Exponential generalizations of Newman＇s inequality and Klamkin＇s inequality are established by the Wang Wan-lan＇s inequality, and they are extended to the cases involving general elementary symmetric functions. As an application, some new inequalities for a simplex are established. In addition, an open problem is posed.
基金Supported by the National Natural Science Foundation of China(Grant No.60573028)the Open Founds of Key Lab of Fujian Province University Network Security and Cryptology(Grant No. 07A003)the Basic Research Foundation of National University of Defense Technology(Grant No.JC07-02-03)
文摘The properties of the 2m-variable symmetric Boolean functions with maximum al- gebraic immunity are studied in this paper. Their value vectors, algebraic normal forms, and algebraic degrees and weights are all obtained. At last, some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.
基金supported by the National Natural Science Foundation of China under Grant Nos.11071285 and 61121062973 Project under Grant No.2011CB302401the National Center for Mathematics and Interdisciplinary Sciences,Chinese Academy of Sciences
文摘This paper provides a systematic method on the enumeration of various permutation symmetric Boolean functions. The results play a crucial role on the search of permutation symmetric Boolean functions with good cryptographic properties. The proposed method is algebraic in nature. As a by-product, the authors correct and generalize the corresponding results of St^nic~ and Maitra （2008）. Further, the authors give a complete classification of block-symmetric bent functions based on the results of Zhao and Li （2006）, and the result is the only one classification of a certain class of permutation symmetric bent functions after the classification of symmetric bent functions proposed by Savicky （1994）.
基金supported by National Natural Science Foundation of China(Grant No.11531004)the Simons Foundation(Grant No.523868)。
文摘We study bosonic tau functions in relation with the charged free bosonic fields.It is proved that up to a constant the only tau function in the Fock space M is the vacuum vector,and some tau functions are given in the completion M by using Schur functions.We also give a new proof of Borchardt’s identity and obtain several q-series identities by using the boson-boson correspondence.
基金supported by the National Natural Science Foundation of China (10871068,61021004)DNRF-NSFC Joint (11061130539)
文摘From the motivation of algebraic attacks on stream and block ciphers,the concept of algebraic immunity（AI） of a Boolean function was introduced and studied extensively.High algebraic immunity is a necessary condition for resisting algebraic attacks.In this paper,we give some lower bounds on the algebraic immunity of Boolean functions.The results are applied to give lower bounds on the AI of symmetric Boolean functions and rotation symmetric Boolean functions.Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value「n/2」are constructed.
