On a convex body with odd hadwiger number

We construct a convex body K ⊃ ℝ³ such that the maximum number of mutually nonoverlapping translates of K which touch K is 15. The work is in part supported by grant no. T043556 of the Hungarian National Science Foundation (OTKA).     

The operad of finite labeled tournaments

We study the operad of finite labeled tournaments. We describe the structure of suboperads of this operad generated by simple tournaments. We prove that a suboperad generated by a tournament with two vertices (i.e., the operad of finite linearly ordered sets) is isomorphic to the operad of symmetric groups, and a suboperad generated by a simple tournament with more that two vertices is isomorphic to the quotient operad of the free operad with respect to a certain congruence. We obtain this congruence explicitly.     

Equations in finite fields with restricted solution sets. II (Algebraic equations)

Generalizing earlier results, it is shown that if are “large” subsets of a finite field F _q , then the equations a + b = cd, resp. ab + 1 = cd can be solved with . Other algebraic equations with solutions restricted to “large” subsets of F _q are also studied. The proofs are based on character sum estimates proved in Part I of the paper. Research partially supported by the Hungarian National Foundation for Scientific Research, Grants No. T 043623, T 043631 and T 049693.     

One-dimensional quasiperiodic tilings admitting progressions enclosure

In this paper we consider one-dimensional quasiperiodic tilings based on the use of irrational rotations of a circle. We completely describe a wide class of progressions included in the mentioned tilings.     

High-accuracy schemes of the finite element method for systems of degenerate elliptic equations on an interval

In this paper for the finite elementmethod for systems of degenerate elliptic equations we develop high-accuracy schemes based on multiplicative singularity extraction. We prove theorems about the smoothness of a solution. Based on these theorems we estimate the error of the proposed method.     

On a pythagorean-type functional equation with exponent 3 involving finite fields

We solve the functional equationf(x ³ +y ³) =f(x)³ +f(y)³ for maps of a finite field into itself.     

Derivation of mixture distributions and weighted likelihood function as minimizers of KL-divergence subject to constraints

In this article, mixture distributions and weighted likelihoods are derived within an information-theoretic framework and shown to be closely related. This surprising relationship obtains in spite of the arithmetic form of the former and the geometric form of the latter. Mixture distributions are shown to be optima that minimize the entropy loss under certain constraints. The same framework implies the weighted likelihood when the distributions in the mixture are unknown and information from independent samples generated by them have to be used instead. Thus the likelihood weights trade bias for precision and yield inferential procedures such as estimates that can be more reliable than their classical counterparts.     

Continuous functions taking every value a given number of times

We give necessary and sufficient conditions for a function f: [0, 1] → {1,2,...,w, c} under which there exists a continuous function F: [0, 1] → [0, 1] such that for every y ɛ [0, 1], |F ⁻¹ (y)| = f(y).      

On the maximum number of points at least one unit away from each other in the unit <Emphasis Type="Italic">n</Emphasis>-cube

We present a very short survey of known results and many new estimates and results on the maximum number of points that can be chosen in the n-dimensional unit cube so that every distance between them is at least 1. Research was supported by Slovak national grant VEGA 1/3839/06.     

A mixed finite element method for a shallow shell problem with a stress function

In this paper we consider the problem of a deflected mode of a shallow shell. The stress function and the normal component of the displacement of the median surface of the shell are unknown functions. We propose a mixed variational statement of the problem, where the second derivatives of the stress function and the normal component of the displacement of the median surface are additional unknowns. This enables us to construct the finite element approximation of the initial problem. We prove the existence of a unique solution of the approximating problem and estimate the rate of convergence of the discrete solution.     

Some remarks on trigonometric sums

Let

Some algorithms for equivalent transformation of nondeterministic finite automata

In this paper we consider algorithms which allow one to combine several states of a nondeterministic finite automaton into one state. Along with the algorithms for combining states, we adduce one more algorithm for the equivalent transformation of a non-deterministic finite automaton, namely, an algorithm for adding cycles. Problems under consideration imply the development of robust computer programs.     

Collapsing monoids consisting of permutations and constants

In this paper we determine all collapsing transformation monoids that contain at least one unary constant operation and whose nonconstant operations are permutations. Furthermore, we find an infinite family of transformation monoids that consist of at least three unary constant operations and some permutations for which the corresponding monoidal intervals are 2-element chains. This research is supported by Hungarian National Foundation for Scientific Research grant nos. T 37877 and K 60148.     

A lower bound for the number of function evaluations in an error estimate for numerical integration

A popular practical way to estimate the error in numerical integration is to use two cubature formulae. In this paper we give a lower bound for the number of function evaluations necessary to approximate the integral and the error.Communicated by Ronald A. DeVore.AMS classification: 65D30, 65G99.     

On the complexity of a family related to the Legendre symbol

Ahlswede, Khachatrian, Mauduit and A. Sárközy introduced the notion of family-complexity of families of binary sequences. They estimated the family-complexity of a large family related to Legendre symbol introduced by Goubin, Mauduit and Sárközy. Here their result is improved, and apart from the constant factor the best lower bound is given for the family-complexity.     

Varieties of rings,where all subdirectly irreducible finite rings are Armendariz ones

In this paper we study varieties of rings, where all subdirectly irreducible finite rings are Armendariz. We also describe the locally finite varieties of Armendariz rings.     

Polytopes passing through circles

Suppose a convex body wants to pass through a circular hole in a wall. Does its ability to do so depend on the thickness of the wall? In fact in most cases it does, and in this paper we present a sufficient criterion for a polytope to allow an affirmative answer to the question.     

On the stability of the quadratic functional equation on bounded domains

A result of Skof and Terracini will be generalized; More precisely, we will prove that if a functionf : [-t, t]ⁿ →E satisfies the inequality (1) for some δ > 0 and for allx, y ∈ [-t, t]ⁿ withx + y, x - y ∈ [-t, t]ⁿ, then there exists a quadratic functionq: ℝⁿ →E such that ∥f(x) -q(x)∥ < (2912n² + 1872n + 334)δ for anyx ∈ [-t, t] ⁿ .     

On multivariate polynomial interpolation

We provide a map which associates each finite set in complexs-space with a polynomial space from which interpolation to arbitrary data given at the points in is possible and uniquely so. Among all polynomial spacesQ from which interpolation at is uniquely possible, our is of smallest degree. It is alsoD- and scale-invariant. Our map is monotone, thus providing a Newton form for the resulting interpolant. Our map is also continuous within reason, allowing us to interpret certain cases of coalescence as Hermite interpolation. In fact, our map can be extended to the case where, with eachgq, there is associated a polynomial space P, and, for given smoothf, a polynomialqQ is sought for which

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-convergence of Lagrange interpolation on the semiaxis

In order to approximate functions defined on (0, +∞), the authors consider suitable Lagrange polynomials and show their convergence in weighted L ^p -spaces.