arXiv subjects

Chun-Ming Yuan

Publications and source records attributed to Chun-Ming Yuan.

13 recordsLinked to original sources

arXiv2021

New bounds and efficient algorithm for sparse difference resultant

The sparse difference resultant introduced in \citep{gao-2015} is a basic concept in difference elimination theory. In this paper, we show that the sparse difference resultant of a generic Laurent transformally essential system can be computed via the sparse resultant of a simple algebraic system arising from the difference system. Moreover, new order bounds of sparse difference resultant are found. Then we propose an efficient algorithm to compute sparse difference resultant which is the quotient of two determinants whose elements are the coefficients of the polynomials in the algebraic system. The complexity of the algorithm is analyzed and experimental results show the efficiency of the algorithm.

cs.SC↗

arXiv2021

A Generalization of the Concavity of Rényi Entropy Powe

Recently, Savaré-Toscani proved that the Rényi entropy power of general probability densities solving the $p$-nonlinear heat equation in $\mathbb{R}^n$ is always a concave function of time, which extends Costa's concavity inequality for Shannon's entropy power to Rényi entropies. In this paper, we give a generalization of Savaré-Toscani's result by giving a class of sufficient conditions of the parameters under which the concavity of the Rényi entropy power is still valid. These conditions are quite general and include the parameter range given by Savaré-Toscani as special cases. Also, the conditions are obtained with a systematical approach.

cs.IT↗

arXiv2020

Lower Bound on Derivatives of Costa's Differential Entropy

Several conjectures concern the lower bound for the differential entropy $H(X_t)$ of an $n$-dimensional random vector $X_t$ introduced by Costa. Cheng and Geng conjectured that $H(X_t)$ is completely monotone, that is, $C_1(m,n): (-1)^{m+1}(d^m/d^m t)H(X_t)\ge0$. McKean conjectured that Gaussian $X_{Gt}$ achieves the minimum of $(-1)^{m+1}(d^m/d^m t)H(X_t)$ under certain conditions, that is, $C_2(m,n): (-1)^{m+1}(d^m/d^m t)H(X_t)\ge(-1)^{m+1}(d^m/d^m t)H(X_{Gt})$. McKean's conjecture was only considered in the univariate case before: $C_2(1,1)$ and $C_2(2,1)$ were proved by McKean and $C_2(i,1),i=3,4,5$ were proved by Zhang-Anantharam-Geng under the log-concave condition. In this paper, we prove $C_2(1,n)$, $C_2(2,n)$ and observe that McKean's conjecture might not be true for $n>1$ and $m>2$. We further propose a weaker version $C_3(m,n): (-1)^{m+1}(d^m/d^m t)H(X_t)\ge(-1)^{m+1}\frac{1}{n}(d^m/d^m t)H(X_{Gt})$ and prove $C_3(3,2)$, $C_3(3,3)$, $C_3(3,4)$, $C_3(4,2)$ under the log-concave condition. A systematical procedure to prove $C_l(m,n)$ is proposed based on semidefinite programming and the results mentioned above are proved using this procedure.

cs.IT↗

arXiv2020

Prove Costa's Entropy Power Inequality and High Order Inequality for Differential Entropy with Semidefinite Programming

Costa's entropy power inequality is an important generalization of Shannon's entropy power inequality. Related with Costa's entropy power inequality and a conjecture proposed by McKean in 1966, Cheng-Geng recently conjectured that $D(m,n): (-1)^{m+1}(\partial^m/\partial^m t)H(X_t)\ge0$, where $X_t$ is the $n$-dimensional random variable in Costa's entropy power inequality and $H(X_t)$ the differential entropy of $X_t$. $D(1,n)$ and $D(2,n)$ were proved by Costa as consequences of Costa's entropy power inequality. Cheng-Geng proved $D(3,1)$ and $D(4,1)$. In this paper, we propose a systematical procedure to prove $D(m,n)$ and Costa's entropy power inequality based on semidefinite programming. Using software packages based on this procedure, we prove $D(3,n)$ for $n=2,3,4$ and give a new proof for Costa's entropy power inequality. We also show that with the currently known constraints, $D(5,1)$ and $D(4,2)$ cannot be proved with the procedure.

math.PR↗

arXiv2018

Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis

In this paper, we give quantum algorithms for two fundamental computation problems: solving polynomial systems over finite fields and optimization where the arguments of the objective function and constraints take values from a finite field or a bounded interval of integers. The quantum algorithms can solve these problems with any given success probability and have polynomial runtime complexities in the size of the input, the degree of the inequality constraints, and the condition number of certain matrices derived from the problem. So, we achieved exponential speedup for these problems when their condition numbers are small. As applications, quantum algorithms are given to three basic computational problems in cryptography: the polynomial system with noise problem, the short integer solution problem, the shortest vector problem, as well as the cryptanalysis for the lattice based NTRU cryptosystem. It is shown that these problems and NTRU can against quantum computer attacks only if their condition numbers are large, so the condition number could be used as a new criterion for the lattice based post-quantum cryptosystems.

cs.SC↗

arXiv2016

A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm is also shown to be practically more efficient than existing algorithms. The algorithm is based on three key ingredients. First, an F4 style algorithm to compute the Groebner basis is adopted, where a novel prolongation is designed such that the coefficient matrices under consideration have polynomial sizes. Second, fast algorithms to compute Hermite normal forms of matrices over Z are used. Third, the complexity of the algorithm are guaranteed by a nice estimation for the degree and height bounds of the polynomials in the generalized Hermite normal form.

cs.SC↗

arXiv2016

Toric Difference Variety

In this paper, the concept of toric difference varieties is defined and four equivalent descriptions for toric difference varieties are presented in terms of difference rational parametrization, difference coordinate rings, toric difference ideals, and group actions by difference tori. Connections between toric difference varieties and affine N[x]-semimodules are established by proving the correspondence between the irreducible invariant difference subvarieties and the faces of the N[x]-submodules and the orbit-face correspondence. Finally, an algorithm is given to decide whether a binomial difference ideal represented by a Z[x]-lattice defines a toric difference variety.

cs.SC↗

arXiv2016

Binomial Difference Ideals

In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Groebner basis of Z[x]-lattices, regular and coherent difference ascending chains, and partial characters over Z[x]-lattices, respectively. Criteria for a Laurent binomial difference ideal to be reflexive, prime, well-mixed, and perfect are given in terms of their support lattices. The reflexive, well-mixed, and perfect closures of a Laurent binomial difference ideal are shown to be binomial. Most of the properties of Laurent binomial difference ideals are extended to the case of difference binomial ideals. Finally, algorithms are given to check whether a given Laurent binomial difference ideal I is reflexive, prime, well-mixed, or perfect, and in the negative case, to compute the reflexive, well-mixed, and perfect closures of I. An algorithm is given to decompose a finitely generated perfect binomial difference ideal as the intersection of reflexive prime binomial difference ideals.

cs.SC↗

arXiv2015

Binomial Difference Ideal and Toric Difference Variety

In this paper, the concepts of binomial difference ideals and toric difference varieties are defined and their properties are proved. Two canonical representations for Laurent binomial difference ideals are given using the reduced Groebner basis of Z[x]-lattices and regular and coherent difference ascending chains, respectively. Criteria for a Laurent binomial difference ideal to be reflexive, prime, well-mixed, perfect, and toric are given in terms of their support lattices which are Z[x]-lattices. The reflexive, well-mixed, and perfect closures of a Laurent binomial difference ideal are shown to be binomial. Four equivalent definitions for toric difference varieties are presented. Finally, algorithms are given to check whether a given Laurent binomial difference ideal I is reflexive, prime, well-mixed, perfect, or toric, and in the negative case, to compute the reflexive, well-mixed, and perfect closures of I. An algorithm is given to decompose a finitely generated perfect binomial difference ideal as the intersection of reflexive prime binomial difference ideals.

math.AG↗

arXiv2013

Sparse Difference Resultant

In this paper, the concept of sparse difference resultant for a Laurent transformally essential system of difference polynomials is introduced and a simple criterion for the existence of sparse difference resultant is given. The concept of transformally homogenous polynomial is introduced and the sparse difference resultant is shown to be transformally homogenous. It is shown that the vanishing of the sparse difference resultant gives a necessary condition for the corresponding difference polynomial system to have non-zero solutions. The order and degree bounds for sparse difference resultant are given. Based on these bounds, an algorithm to compute the sparse difference resultant is proposed, which is single exponential in terms of the number of variables, the Jacobi number, and the size of the Laurent transformally essential system. Furthermore, the precise order and degree, a determinant representation, and a Poisson-type product formula for the difference resultant are given.

cs.SC↗

arXiv2012

Sparse Differential Resultant for Laurent Differential Polynomials

In this paper, we first introduce the concept of Laurent differentially essential systems and give a criterion for Laurent differentially essential systems in terms of their supports. Then the sparse differential resultant for a Laurent differentially essential system is defined and its basic properties are proved. In particular, order and degree bounds for the sparse differential resultant are given. Based on these bounds, an algorithm to compute the sparse differential resultant is proposed, which is single exponential in terms of the number of indeterminates, the Jacobi number of the system, and the size of the system.

cs.SC↗

arXiv2012

Matrix Formula of Differential Resultant for First Order Generic Ordinary Differential Polynomials

In this paper, a matrix representation for the differential resultant of two generic ordinary differential polynomials $f_1$ and $f_2$ in the differential indeterminate $y$ with order one and arbitrary degree is given. That is, a non-singular matrix is constructed such that its determinant contains the differential resultant as a factor. Furthermore, the algebraic sparse resultant of $f_1, f_2, δf_1, δf_2$ treated as polynomials in $y, y', y"$ is shown to be a non-zero multiple of the differential resultant of $f_1, f_2$. Although very special, this seems to be the first matrix representation for a class of nonlinear generic differential polynomials.

cs.SC↗

arXiv2011

Intersection Theory in Differential Algebraic Geometry: Generic Intersections and the Differential Chow Form

In this paper, an intersection theory for generic differential polynomials is presented. The intersection of an irreducible differential variety of dimension $d$ and order $h$ with a generic differential hypersurface of order $s$ is shown to be an irreducible variety of dimension $d-1$ and order $h+s$. As a consequence, the dimension conjecture for generic differential polynomials is proved. Based on the intersection theory, the Chow form for an irreducible differential variety is defined and most of the properties of the Chow form in the algebraic case are established for its differential counterpart. Furthermore, the generalized differential Chow form is defined and its properties are proved. As an application of the generalized differential Chow form, the differential resultant of $n+1$ generic differential polynomials in $n$ variables is defined and properties similar to that of the Macaulay resultant for multivariate polynomials are proved.

math.AG↗