Construction of pseudorandom binary lattices by using the multiplicative inverse

In an earlier work Hubert and the authors of this paper introduced and studied the notion of pseudorandomness of binary lattices. Later in another paper the authors gave a construction for a large family of “good” binary lattices by using the quadratic characters of finite fields. Here, a further large family of “good” binary lattices is constructed by using finite fields and the notion of multiplicative inverse.     

Sensitivity Analysis of Wave-equation Tomography: A Multi-scale Approach

Earthquakes, viewed as passive sources, or controlled sources, like explosions, excite seismic body waves in the earth. One detects these waves at seismic stations distributed over the earth’s surface. Wave-equation tomography is derived from cross correlating, at each station, data simulated in a reference model with the observed data, for a (large) set of seismic events. The times corresponding with the maxima of these cross correlations replace the notion of residual travel times used as data in traditional tomography. Using first-order perturbation, we develop an analysis of the mapping from a wavespeed contrast (between the “true” and reference models) to these maxima. We develop a construction using curvelets, while establishing a connection with the geodesic X-ray transform. We then introduce the adjoint mapping, which defines the imaging of wavespeed variations from “finite-frequency travel time” residuals. The key underlying component is the construction of the Fréchet derivative of the solution to the seismic Cauchy initial value problem in wavespeed models of limited smoothness. The construction developed in this paper essentially clarifies how a wavespeed model is probed by the method of wave-equation tomography.     

Approximation of impulse controls

The application of impulse controls—delta-function and its higher derivatives—essentially improves our ability to control various systems. However, the delta-function and its derivatives are “idealizations.” Controls applied to model and control real systems are finite (although possibly quite large in magnitude). In this article we consider bounded approximations of impulse controls—so-called fast controls—and examine methods of their construction.     

Drinfeld Modules of Rank 1 and Algebraic Curves with Many Rational Points

 We construct algebraic curves C defined over a finite prime field such that the number of -rational points of C is large relative to the genus of C. The methods of construction are based on the relationship between algebraic curves and their function fields, as well as on narrow ray class extensions obtained from Drinfeld modules of rank 1. Received 21 July 1997; in revised form 5 February 1998     

Polyhedral surfaces in wedge products

We introduce the wedge product of two polytopes. The wedge product is described in terms of inequality systems, in terms of vertex coordinates as well as purely combinatorially, from the corresponding data of its constituents. The wedge product construction can be described as an iterated “subdirect product” as introduced by McMullen (Discrete Math 14:347–358, 1976); it is dual to the “wreath product” construction of Joswig and Lutz (J Combinatorial Theor A 110:193–216, 2005). One particular instance of the wedge product construction turns out to be especially interesting: The wedge products of polygons with simplices contain certain combinatorially regular polyhedral surfaces as subcomplexes. These generalize known classes of surfaces “of unusually large genus” that first appeared in works by Coxeter (Proc London Math Soc 43:33–62, 1937), Ringel (Abh Math Seminar Univ Hamburg 20:10–19, 1956), and McMullen et al. (Israel J Math 46:127–144, 1983). Via “projections of deformed wedge products” we obtain realizations of some of the surfaces in the boundary complexes of 4-polytopes, and thus in \mathbb R³{{\mathbb R}^3} . As additional benefits our construction also yields polyhedral subdivisions for the interior and the exterior, as well as a great number of local deformations (“moduli”) for the surfaces in \mathbb R³{{\mathbb R}^3} . In order to prove that there are many moduli, we introduce the concept of “affine support sets” in simple polytopes. Finally, we explain how duality theory for 4-dimensional polytopes can be exploited in order to also realize combinatorially dual surfaces in \mathbb R³{{\mathbb R}^3} via dual 4-polytopes.     

On Large Systems of Sets with No Large Weak Δ-subsystems

weak Δ-system if the cardinality of the intersection of any two sets is the same. We elaborate a construction by R?dl and Thoma [9] and show that for large n, there exists a family ℱ of subsets of without weak Δ-systems of size 3 with . Received: October 1, 1997     

Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity

So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of annihilator immunity. This construction provides functions with the maximum possible annihilator immunity and the weight, nonlinearity and algebraic degree of the functions can be properly calculated under certain cases. The basic construction is that of symmetric Boolean functions and applying linear transformation on the input variables of these functions, one can get a large class of non-symmetric functions too. Moreover, we also study several other modifications on the basic symmetric functions to identify interesting non-symmetric functions with maximum annihilator immunity. In the process we also present an algorithm to compute the Walsh spectra of a symmetric Boolean function with O(n²) time and O(n) space complexity. We use the term “Annihilator Immunity” instead of “Algebraic Immunity” referred in the recent papers [3–5, 9, 18, 19]. Please see Remark 1 for the details of this notational change     

Tripling Construction for Large Sets of Resolvable Directed Triple Systems

In this paper, we first define a doubly transitive resolvable idempotent quasigroup （DTRIQ）, and show that aDTRIQ of order v exists if and only ifv ≡0（mod3） and v ≠ 2（mod4）. Then we use DTRIQ to present a tripling construction for large sets of resolvable directed triple systems, which improves an earlier version of tripling construction by Kang （J. Combin. Designs, 4 （1996）, 301-321）. As an application, we obtain an LRDTS（4·3^n） for any integer n ≥ 1, which provides an infinite family of even orders.     

AdS/CFT duality at strong coupling

We study the strong-coupling limit of the AdS/CFT correspondence in the framework of a recently proposed fermionic formulation of the Bethe ansatz equations governing the gauge theory anomalous dimensions. We give examples of states that do not follow the Gubser-Klebanov-Polyakov law at a large ’t Hooft coupling λ, in contrast to recent results on the quantum string Bethe equations that are valid in that regime. This result indicates that the fermionic construction cannot be trusted at large λ, although it remains an efficient tool for computing the weak-coupling expansion of anomalous dimensions. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 152, No. 2, pp. 213–224, August, 2007.     

Drinfeld Modules of Rank 1 and Algebraic Curves with Many Rational Points

 We construct algebraic curves C defined over a finite prime field such that the number of -rational points of C is large relative to the genus of C. The methods of construction are based on the relationship between algebraic curves and their function fields, as well as on narrow ray class extensions obtained from Drinfeld modules of rank 1.     

Construction of pseudorandom binary lattices by using the multiplicative inverse

In an earlier work Hubert and the authors of this paper introduced and studied the notion of pseudorandomness of binary lattices. Later in another paper the authors gave a construction for a large family of “good” binary lattices by using the quadratic characters of finite fields. Here, a further large family of “good” binary lattices is constructed by using finite fields and the notion of multiplicative inverse. Authors’ addresses: Christian Mauduit, Institut de Mathématiques de Luminy, CNRS, UMR 6206, 163 avenue de Luminy, Case 907, F-13288 Marseille Cedex 9, France; András Sárk?zy, Department of Algebra and Number Theory, E?tv?s Loránd University, Pázmány Péter sétány 1/C, H-1117 Budapest, Hungary     

A Unified Construction of Generalized Classical Polynomials Associated with Operators of Calogero–Sutherland Type

In this paper we consider a large class of many-variable polynomials which contains generalizations of the classical Hermite, Laguerre, Jacobi and Bessel polynomials as special cases, and which occur as the polynomial part in the eigenfunctions of Calogero–Sutherland type operators and their deformations recently found and studied by Chalykh, Feigin, Sergeev, and Veselov. We present a unified and explicit construction of all these polynomials.     

Explicit Nordsieck methods with quadratic stability

We describe the construction of explicit Nordsieck methods with s stages of order p = s − 1 and stage order q = p with inherent quadratic stability and quadratic stability with large regions of absolute stability. Stability regions of these methods compare favorably with stability regions of corresponding general linear methods of the same order with inherent Runge–Kutta stability.     

Korteweg-de Vries hierarchy as an asymptotic limit of the Boussinesq system

For the model of surface waves, we perform an asymptotic analysis with respect to a small parameter ε for large times where corrections to the approximation described by the Korteweg-de Vries equation must be taken into account. We reveal the appearance of the Korteweg-de Vries hierarchy, which ensures the construction of an asymptotic representation up to the times t ≈ ε⁻², where the Korteweg-de Vries approximation becomes inapplicable. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 154, No. 2, pp. 294–304, February, 2008.     

Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Worst Case Setting

We consider approximation of linear multivariate problems defined over weighted tensor product Hilbert spaces with finite-order weights. This means we consider functions of d variables that can be represented as sums of functions of at most q^* variables. Here, q^* is fixed (and presumably small) and d may be arbitrarily large. For the univariate problem, d = 1, we assume we know algorithms A1,ε that use O(ε−p) function or linear functional evaluations to achieve an error ε in the worst case setting. Based on these algorithms A_1,ε, we provide a construction of polynomial-time algorithms A_d,ε for the general d-variate problem with the number of evaluations bounded roughly by ε^−pd^q* to achieve an error ε in the worst case setting.     

On the infinite divisibility of squared Gaussian processes

 We show that fractional Brownian motions with index in (0,1] satisfy a remarkable property: their squares are infinitely divisible. We also prove that a large class of Gaussian processes are sharing this property. This property then allows the construction of two-parameters families of processes having the additivity property of the squared Bessel processes. Received: 1 April 2002 / Revised version: 7 September 2002 / Published online: 19 December 2002 Mathematics Subject Classification (2000): 60E07, 60G15, 60J25, 60J55 Key words or phrases: Gaussian processes – Infinite divisibility – Markov processes     

On large equilateral point-sets in normed spaces

What is the largest cardinal of a two-by-two equilateral point-set in an n-dimensional Minkowski space? It is conjectured that this cardinal is at least $$n+1$$, and several spaces are tight in this regard, such as the Euclidean space. In this paper, we prove in normed spaces X with the $$(H_1,\dots ,H_{n-1})$$-2-intersection property the existence of $$n+1$$ equilateral point-sets of large diameter inscribed to the unit ball B. This extends the construction of Makeev (J Math Sci (N Y) 140:548–550, 2007) in dimension 4.     

The study of collision and avalanche effect in a family of pseudorandom binary sequences

In an earlier paper we studied collisions and avalanche effect in two of the most important constructions given for large families of binary sequences possessing strong pseudorandom properties. It turned out that one of the two constructions (which is based on the use of the Legendre symbol) is ideal from this point of view, while the other construction (which is based on the size of the modulo p residue of f(n) for some polynomial f(x) ∈ $ \mathbb{F}_p $ \mathbb{F}_p [x]) is not satisfactory since there are “many” collisions in it. Here it is shown that this weakness of the second construction can be corrected: one can take a subfamily of the given family which is just slightly smaller and collision free.     

D-Dimensional hypercubes and the Euler and MacNeish conjectures

We give a construction for large sets of mutually orthogonal hypercubes of dimensionald given sets of mutually orthogonal latin squares and hypercubes of lower dimension. We also considerd>-2 dimensional versions of the Euler and MacNeish conjectures as well as discussing applications to improved constructions of (t, m, s)-nets, useful in pseudorandom number generation and quasi-Monte-Carlo methods of numerical integration.This author would like to thank the National Security Agency for partial support under grant agreement # MDA 904-92-H-3044.