A bifurcation result for harmonic maps from an annulus to with not symmetric boundary data

We consider the problem of minimizing the energy of the maps from the annulus to such that is equal to for , and to , for , where is a fixed angle.

We prove that the minimum is attained at a unique harmonic map which is a planar map if , while it is not planar in the case \pi^2$">.

Moreover, we show that tends to as , where minimizes the energy of the maps from to , with the boundary condition , .

     

On Diophantine definability and decidability in some infinite totally real extensions of

Let be a number field, and a set of its non-Archimedean primes. Then let . Let be a finite set of prime numbers. Let be the field generated by all the -th roots of unity as and . Let be the largest totally real subfield of . Then for any 0$">, there exist a number field , and a set of non-Archimedean primes of such that has density greater than , and has a Diophantine definition over the integral closure of in .

     

Nonlinearizable actions of dihedral groups on affine space

Let be a reductive, non-abelian, algebraic group defined over . We investigate algebraic -actions on the total spaces of non-trivial algebraic -vector bundles over -modules with great interest in the case that is a dihedral group. We construct a map classifying such actions of a dihedral group in some cases and describe the spaces of those non-linearizable actions in some examples.

     

Steinhaus tiling problem and integral quadratic forms

A lattice in is said to be equivalent to an integral lattice if there exists a real number such that the dot product of any pair of vectors in is an integer. We show that if and is equivalent to an integral lattice, then there is no measurable Steinhaus set for , a set which no matter how translated and rotated contains exactly one vector in .

     

The parameterized algorithm for symplectic (butterfly) matrices

The algorithm is a structure-preserving algorithm for computing the spectrum of symplectic matrices. Any symplectic matrix can be reduced to symplectic butterfly form. A symplectic matrix in butterfly form is uniquely determined by parameters. Using these parameters, we show how one step of the symplectic algorithm for can be carried out in arithmetic operations compared to arithmetic operations when working on the actual symplectic matrix. Moreover, the symplectic structure, which will be destroyed in the numerical process due to roundoff errors when working with a symplectic (butterfly) matrix, will be forced by working just with the parameters.

     

A hidden number problem in small subgroups

Boneh and Venkatesan have proposed a polynomial time algorithm for recovering a hidden element , where is prime, from rather short strings of the most significant bits of the residue of modulo for several randomly chosen . González Vasco and the first author have recently extended this result to subgroups of of order at least for all and to subgroups of order at least for almost all . Here we introduce a new modification in the scheme which amplifies the uniformity of distribution of the multipliers and thus extend this result to subgroups of order at least for all primes . As in the above works, we give applications of our result to the bit security of the Diffie-Hellman secret key starting with subgroups of very small size, thus including all cryptographically interesting subgroups.

     

Two Questions of Erdős on Hypergraphs above the Turán Threshold

For ordinary graphs it is known that any graph G with more edges than the Turán number of must contain several copies of , and a copy of , the complete graph on vertices with one missing edge. Erd?s asked if the same result is true for , the complete 3‐uniform hypergraph on s vertices. In this note, we show that for small values of n, the number of vertices in G, the answer is negative for . For the second property, that of containing a , we show that for the answer is negative for all large n as well, by proving that the Turán density of is greater than that of .     

Generic finiteness for Dziobek configurations

The goal of this paper is to show that for almost all choices of masses, , there are only finitely many central configurations of the Newtonian -body problem for which the bodies span a space of dimension (such a central configuration is called a Dziobek configuration). The result applies in particular to two-dimensional configurations of four bodies and three-dimensional configurations of five bodies.

     

Blowup for

In this note we consider the global regularity of smooth solutions to the vector-valued Cauchy problem

We show that if , the gradient-blowup phenomenon occurs in finite time for suitably chosen vanishing at infinity. We also present a simple example of the -blowup solutions for for any 0$">, if .

     

On a lattice problem of H. Steinhaus

It is shown that there is a subset of such that each isometric copy of (the lattice points in the plane) meets in exactly one point. This provides a positive answer to a problem of H. Steinhaus.

     

Complexity of inverting the Euler function

Given an integer , how hard is it to find the set of all integers such that , where is the Euler totient function? We present a certain basic algorithm which, given the prime number factorization of , in polynomial time ``on average' (that is, ), finds the set of all such solutions . In fact, in the worst case this set of solutions is exponential in , and so cannot be constructed by a polynomial time algorithm. In the opposite direction, we show, under a widely accepted number theoretic conjecture, that the PARTITION PROBLEM, an NP-complete problem, can be reduced in polynomial (in the input size) time to the problem of deciding whether has a solution, for polynomially (in the input size of the PARTITION PROBLEM) many values of (where the prime factorizations of these are given). What this means is that the problem of deciding whether there even exists a solution to , let alone finding any or all such solutions, is very likely to be intractable. Finally, we establish close links between the problem of inverting the Euler function and the integer factorization problem.

     

Linear bijections preserving the Hölder seminorm

Let be a compact metric space and let be a real number with The aim of this paper is to solve a linear preserver problem on the Banach algebra of Hölder functions of order from into We show that each linear bijection having the property that for every where

is of the form for every where with is a surjective isometry and is a linear functional.

     

The number of planar central configurations for the -body problem is finite when mass positions are fixed

In the -body problem a central configuration is formed when the position vector of each particle with respect to the center of mass is a common scalar multiple of its acceleration vector. Lindstrom showed for and for 4$"> that if masses are located at fixed points in the plane, then there are only a finite number of ways to position the remaining th mass in such a way that they define a central configuration. Lindstrom leaves open the case . In this paper we prove the case using as variables the mutual distances between the particles.

     

The Dirichlet problem and nondivergence harmonic measure

We consider the Dirichlet problem

for two second-order elliptic operators , , in a bounded Lipschitz domain . The coefficients belong to the space of bounded mean oscillation with a suitable small modulus. We assume that is regular in for some , , that is, for all continuous boundary data . Here is the surface measure on and is the nontangential maximal operator. The aim of this paper is to establish sufficient conditions on the difference of the coefficients that will assure the perturbed operator to be regular in for some , .

     

A new result on the Pompeiu problem

A nonempty bounded open set () is said to have the Pompeiu property if and only if the only continuous function on for which the integral of over is zero for all rigid motions of is . We consider a nonempty bounded open set with Lipschitz boundary and we assume that the complement of is connected. We show that the failure of the Pompeiu property for implies some geometric conditions. Using these conditions we prove that a special kind of solid tori in , , has the Pompeiu property. So far the result was proved only for solid tori in . We also examine the case of planar domains. Finally we extend the example of solid tori to domains in bounded by hypersurfaces of revolution.

     

Existence of solutions for three-point boundary value problems for second order equations

Shooting methods are employed to obtain solutions of the three-point boundary value problem for the second order equation, where is continuous, and and conditions are imposed implying that solutions of such problems are unique, when they exist.

     

Existence and asymptotic behavior for a singular parabolic equation

We prove global existence of nonnegative solutions to the singular parabolic equation 0 \} } ( -u^{-\beta} + \lambda f(u) )=0$"> in a smooth bounded domain with zero Dirichlet boundary condition and initial condition , . In some cases we are also able to treat . Then we show that if the stationary problem admits no solution which is positive a.e., then the solutions of the parabolic problem must vanish in finite time, a phenomenon called ``quenching'. We also establish a converse of this fact and study the solutions with a positive initial condition that leads to uniqueness on an appropriate class of functions.