Noetherian varieties in definably complete structures

We prove that the zero-set of a C ^∞ function belonging to a noetherian differential ring M can be written as a finite union of C ^∞ manifolds which are definable by functions from the same ring. These manifolds can be taken to be connected under the additional assumption that every zero-dimensional regular zero-set of functions in M consists of finitely many points. These results hold not only for C ^∞ functions over the reals, but more generally for definable C ^∞ functions in a definably complete expansion of an ordered field. The class of definably complete expansions of ordered fields, whose basic properties are discussed in this paper, expands the class of real closed fields and includes o-minimal expansions of ordered fields. Finally, we provide examples of noetherian differential rings of C ^∞ functions over the reals, containing non-analytic functions.     

Cosine transforms over fields of characteristic 2

In this paper, we introduce cosine transforms over fields of characteristic 2. Our approach complements previous definitions of finite field trigonometric transforms, which only hold for fields whose characteristic is an odd prime. Besides introducing some new concepts related to trigonometry in finite fields, we discuss the eigenstructure and other important properties of the proposed transforms.     

Cyclotomic matrices and hypergeometric functions over finite fields

With the help of hypergeometric functions over finite fields, we study some arithmetic properties of cyclotomic matrices involving characters and binary quadratic forms over finite fields. Also, we confirm some related conjectures posed by Zhi-Wei Sun.     

幂函数的一些密码学性质

二元域上n数组空间上的非线性置换在分组码，杂凑函数与流密码等密码学领域中有重要应用.域GF（2n）上的幂函数提供了二元域上n数组空间上的一类非线性置换．本文着重研究幂函数的强完全性、完全性与非线性度等密码学性质．作为结果，本文证明了幂函数具有完全性；证明了具有强完全性的函数必有较高的拓扑非线性度；木文找到一类具有强完全性的幂函数；周时也定出了幂函数的代数非线性度．     

A note on orthonormal polynomial bases and wavelets

A simple and explicit construction of an orthnormal trigonometric polynomial basis in the spaceC of continuous periodic functions is presented. It consists simply of periodizing a well-known wavelet on the real line which is orthonormal and has compactly supported Fourier transform. Trigonometric polynomials resulting from this approach have optimal order of growth of their degrees if their indices are powers of 2. Also, Fourier sums with respect to this polynomial basis are projectors onto subspaces of trigonometric polynomials of high degree, which implies almost best approximation properties.     

Asymptotic properties of zeta functions over finite fields

In this paper we study asymptotic properties of families of zeta and L-functions over finite fields. We do it in the context of three main problems: the basic inequality, the Brauer–Siegel type results and the results on distribution of zeroes. We generalize to this abstract setting the results of Tsfasman, Vlăduţ and Lachaud, who studied similar problems for curves and (in some cases) for varieties over finite fields. In the classical case of zeta functions of curves we extend a result of Ihara on the limit behaviour of the Euler–Kronecker constant. Our results also apply to L-functions of elliptic surfaces over finite fields, where we approach the Brauer–Siegel type conjectures recently made by Kunyavskii, Tsfasman and Hindry.     

Finite trigonometric sums and class numbers

Explicit evaluations of finite trigonometric sums arose in proving certain theta function identities of Ramanujan. In this paper, without any appeal to theta functions, several classes of finite trigonometric sums, including the aforementioned sums, are evaluated in closed form in terms of class numbers of imaginary quadratic fields.Mathematics Subject Classification (2000): Primary, 11L03; Secondary, 11R29, 11L10Research partially supported by grant MDA904-00-1-0015 from the National Security Agency.Revised version: 19 April 2004     

Hardy和Littlewood的一个三角和

本文对Hardy和Littlewood考虑的一个有限三角和做了进一步地研究.通过充分运用Chebyshev多项式和Möbius函数的性质，建立了该有限三角和的一个有趣的恒等式，并得到了一个精确的渐近公式.     

Hardy和Littlewood的一个三角和

本文对Hardy和Littlewood考虑的一个有限三角和做了进一步地研究.通过充分运用Chebyshev多项式和M?bius函数的性质,建立了该有限三角和的一个有趣的恒等式,并得到了一个精确的渐近公式.     

Riemann surfaces defined over the reals

The known (explicit) examples of Riemann surfaces not definable over their field of moduli are those with that field being a subfield of the reals but which cannot be defined over the reals. In this paper we provide explicit families of Riemann surfaces which are definable over the reals but cannot be defined over the field of moduli.     

Applications of Smolyak quadrature formulas to the numerical integration of Fourier coefficients and in function recovery problems

In this paper with the help of Smolyak quadrature formulas we calculate exact orders of errors of the numerical integration of trigonometric Fourier coefficients of functions from generalized classes of Korobov and Sobolev types. We apply the obtained results to the recovery of functions from their values at a finite number of points in terms of the K. Sherniyazov approach.     

Computability of String Functions Over Algebraic Structures Armin Hemmerling

We present a model of computation for string functions over single-sorted, total algebraic structures and study some basic features of a general theory of computability within this framework. Our concept generalizes the Blum-Shub-Smale setting of computability over the reals and other rings. By dealing with strings of arbitrary length instead of tuples of fixed length, some suppositions of deeper results within former approaches to generalized recursion theory become superfluous. Moreover, this gives the basis for introducing computational complexity in a BSS-like manner. Relationships both to classical computability and to Friedman's concept of eds computability are established. Two kinds of nondeterminism as well as several variants of recognizability are investigated with respect to interdependencies on each other and on properties of the underlying structures. For structures of finite signatures, there are universal programs with the usual characteristics. For the general case of not necessarily finite signature, this subject will be studied in a separate, forthcoming paper.     

Permutation binomials and their groups

This paper is devoted to studying the properties of permutation binomials over finite fields and the possibility to use permutation binomials as encryption functions. We present an algorithm for enumeration of permutation binomials. Using this algorithm, all permutation binomials for finite fields up to order 15000 were generated. Using this data, we investigate the groups generated by the permutation binomials and discover that over some finite fields \mathbb F_q {{\mathbb F}_q} , every bijective function on [1..q − 1] can be represented as a composition of binomials. We study the problem of generating permutation binomials over large prime fields. We also prove that a generalization of RSA using permutation binomials is not secure. Bibliography: 9 titles.     

Permutation polynomials from trace functions over finite fields

In this paper, we propose several classes of permutation polynomials based on trace functions over finite fields of characteristic 2. The main result of this paper is obtained by determining the number of solutions of certain equations over finite fields.     

An Intuitionistic Axiomatisation of Real Closed Fields

We give an intuitionistic axiomatisation of real closed fields which has the constructive reals as a model. The main result is that this axiomatisation together with just the decidability of the order relation gives the classical theory of real closed fields. To establish this we rely on the quantifier elimination theorem for real closed fields due to Tarski, and a conservation theorem of classical logic over intuitionistic logic for geometric theories.     

相关攻击与相关免疫函数

本文首先介绍了如何采用ＤＣ攻击法对一类流密码体制进行相关攻击，从而说明在密码学中有必要研究相关免疫（ＣＩ）函数。在综述了域Ｆ２上相关免疫（ＣＩ）函数的研究进展的同时，给出了ＣＩ函数在一般有限域上的特性和构造，并进一步研究有限环Ｚ／（ｍ）时的情景，本文详尽描述了ＣＩ函数的五种充要条件。最后提出了几个值得研究的未解决的问题。     

Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology

Symbolic methods to investigate Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. However, the symbolic investigations have not been fully algorithmic but required a sequence of symbolic computations intervened with ad hoc insights and decisions made by a human. In this paper we discuss the use of algebraic and logical methods to reduce questions on the existence of Hopf bifurcations in parameterized polynomial vector fields to quantifier elimination problems over the reals combined with the use of the quantifier elimination over the reals and simplification techniques available in REDLOG. We can reconstruct most of the results given in the literature within a few seconds of computation time and extend the investigations on these systems to previously not analyzed related systems. Especially we discuss cases in which one suspects that no Hopf bifurcation fixed point exists for biologically relevant values of parameters and system variables. Here we focus on logical and algebraic techniques of finding subconditions being inconsistent with the hypothesis of the existence of Hopf bifurcation fixed points.      

Maximal values of generalized algebraic immunity

The notion of algebraic immunity of Boolean functions has been generalized in several ways to vector-valued functions and/or over arbitrary finite fields and reasonable upper bounds for such generalized algebraic immunities has been proved in Armknecht and Krause (Proceedings of ICALP 2006, LNCS, vol. 4052, pp 180–191, 2006), Ars and Faugere (Algebraic immunity of functions over finite fields, INRIA, No report 5532, 2005) and Batten (Canteaut, Viswanathan (eds.) Progress in Cryptology—INDOCRYPT 2004, LNCS, vol. 3348, pp 84–91, 2004). In this paper we show that the upper bounds can be reached as the maximal values of algebraic immunities for most of generalizations by using properties of Reed–Muller codes.