Let K/Q be a finite Galois extension with the Galois group G, and let χ be a nontrivial irreducible character ofG. Artin’s conjecture predicts that the L-function L(s, χ,K/Q) is holomorphic in the whole complex plane ([1], P. 105). Let χ1, . . . , χr be the irreducible nontrivial characters of G. The corresponding L-functions L(s, χ1), . . . , L(s, χr) are algebraically independent over C ([2],...

Stanford University) Abstract: A curve is a one dimensional space cut out by polynomial equations, such as y2=x3+x. In particular, one can consider curves over finite fields, which means the polynomial equations should have coefficients in some finite field and that points on the curve are given by values of the variables (x and y in the example) in the finite field that satisfy the given polyn...

We consider linear dynamical systems defined by differential algebraic equations. The associated input-output behaviour is given by a transfer function in the frequency domain. Physical parameters of the dynamical system are replaced by random variables to quantify uncertainties. We analyse the sensitivity of the transfer function with respect to the random variables. Total sensitivity coeffici...

We consider the global minimization of a multivariate polynomial on a semi-algebraic set defined with polynomial inequalities. We then compare two hierarchies of relaxations, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and recent semidefinite programming (SDP) relaxations introduced by the author. The comp...

We prove that functions f : F2m → F2m of the form f(x) = x + g(x) where g is any non-affine polynomial are APN on at most a finite number of fields F2m . Furthermore we prove that when the degree of g is less then 7 such functions are APN only if m ≤ 3 where these functions are equivalent to x.

No polynomial algorithms are known for finding the coefficients of the characteristic polynomial and characteristic equation of a matrix in max-algebra. The following are proved: (1) The task of finding the max-algebraic characteristic polynomial for permutation matrices encoded using the lengths of their constituent cycles is IVP-complete. (2) The task of finding the lowest order finite term o...