Distance regularity of Kerdock codes

A code is called distance regular, if for every two codewords x, y and integers i, j the number of codewords z such that d(x, z) = i and d(y, z) = j, with d the Hamming distance, does not depend on the choice of x, y and depends only on d(x, y) and i, j. Using some properties of the discrete Fourier transform we give a new combinatorial proof of the distance regularity of an arbitrary Kerdock code. We also calculate the parameters of the distance regularity of a Kerdock code.     

An interior point potential reduction algorithm for the linear complementarity problem

The linear complementarity problem (LCP) can be viewed as the problem of minimizingx ^T y subject toy=Mx+q andx, y?0. We are interested in finding a point withx ^T y <ε for a givenε > 0. The algorithm proceeds by iteratively reducing the potential function $$f(x,y) = \rho \ln x^T y - \Sigma \ln x_j y_j ,$$ where, for example,ρ=2n. The direction of movement in the original space can be viewed as follows. First, apply alinear scaling transformation to make the coordinates of the current point all equal to 1. Take a gradient step in the transformed space using the gradient of the transformed potential function, where the step size is either predetermined by the algorithm or decided by line search to minimize the value of the potential. Finally, map the point back to the original space. A bound on the worst-case performance of the algorithm depends on the parameterλ ^*=λ^*(M, ε), which is defined as the minimum of the smallest eigenvalue of a matrix of the form $$(I + Y^{ - 1} MX)(I + M^T Y^{ - 2} MX)^{ - 1} (I + XM^T Y^{ - 1} )$$ whereX andY vary over the nonnegative diagonal matrices such thate ^T XYe ?ε andX _jj Y _jj?n ². IfM is a P-matrix,λ ^* is positive and the algorithm solves the problem in polynomial time in terms of the input size, |log ε|, and 1/λ ^*. It is also shown that whenM is positive semi-definite, the choice ofρ = 2n+ \(\sqrt {2n} \) yields a polynomial-time algorithm. This covers the convex quadratic minimization problem.     

An Improved Interval Linearization for Solving Nonlinear Problems

Let f(x) denote a system of n nonlinear functions in m variables, m≥n. Recently, a linearization of f(x) in a box x has been suggested in the form L(x)=Ax+b where A is a real n×m matrix and b is an interval n-dimensional vector. Here, an improved linearization L(x,y)=Ax+By+b, x∈x, y∈y is proposed where y is a p-dimensional vector belonging to the interval vector y while A and B are real matrices of appropriate dimensions and b is a real vector. The new linearization can be employed in solving various nonlinear problems: global solution of nonlinear systems, bounding the solution set of underdetermined systems of equations or systems of equalities and inequalities, global optimization. Numerical examples illustrating the superiority of L(x,y)=Ax+By+b over L(x)=Ax+b have been solved for the case where the problem is the global solution of a system of nonlinear equations (n=m).     

Borel measures with a density on a compact semi-algebraic set

Let ${\mathbf{K} \subset \mathbb{R}^n}$ be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no à priori bounding parameter) for a real sequence y = (y _α), ${\alpha \in \mathbb{N}^n}$ , to have a finite representing Borel measure absolutely continuous w.r.t. the Lebesgue measure on K, and with a density in ${\cap_{p \geq 1} L_p(\mathbf{K})}$ . With an additional condition involving a bounding parameter, the condition is necessary and sufficient for the existence of a density in L _∞(K). Moreover, nonexistence of such a density can be detected by solving finitely many of a hierarchy of semidefinite programs. In particular, if the semidefinite program at step d of the hierarchy has no solution, then the sequence cannot have a representing measure on K with a density in L _p (K) for any p ≥ 2d.     

An Erdös-Ko-Rado theorem for the subcubes of a cube

LetP be that partially ordered set whose elements are vectors x=(x ₁, ...,x _n ) withx _i ε {0, ...,k} (i=1, ...,n) and in which the order is given byx≦y iffx _i =y _i orx _i =0 for alli. LetN _i (P)={x εP : |{j:x _j ≠ 0}|=i}. A subsetF ofP is called an Erdös-Ko-Rado family, if for allx, y εF it holdsx ≮y, x ≯ y, and there exists az εN ₁(P) such thatz≦x andz≦y. Let ? be the set of all vectorsf=(f ₀, ...,f _n ) for which there is an Erdös-Ko-Rado familyF inP such that |N _i (P) ∩F|=f _i (i=0, ...,n) and let 〈?〉 be its convex closure in the (n+1)-dimensional Euclidean space. It is proved that fork≧2 (0, ..., 0) and \(\left( {0,...,0,\overbrace {i - component}^{\left( {\begin{array}{*{20}c} {n - 1} \\ {i - 1} \\ \end{array} } \right)}k^{i - 1} ,0,...,0} \right)\) (i=1, ...,n) are the vertices of 〈?〉.     

Generation and Enumeration of Some Classes of Interval Orders

In this paper we consider the class of interval orders, recently considered by several authors from both an algebraic and an enumerative point of view. According to Fishburn’s Theorem (Fishburn J Math Psychol 7:144–149, 1970), these objects can be characterized as posets avoiding the poset 2?+?2. We provide a recursive method for the unique generation of interval orders of size n?+?1 from those of size n, extending the technique presented by El-Zahar (1989) and then re-obtain the enumeration of this class, as done in Bousquet-Melou et al. (2010). As a consequence we provide a method for the enumeration of several subclasses of interval orders, namely AV(2?+?2, N), AV(2?+?2, 3?+?1), AV(2?+?2, N, 3?+?1). In particular, we prove that the first two classes are enumerated by the sequence of Catalan numbers, and we establish a bijection between the two classes, based on the cardinalities of the principal ideals of the posets.     

AnO(\sqrt n L) iteration potential reduction algorithm for linear complementarity problems

This paper proposes an interior point algorithm for a positive semi-definite linear complementarity problem: find an (x, y)∈? ²ⁿ such thaty=Mx+q, (x,y)?0 andx ^T y=0. The algorithm reduces the potential function $$f(x,y) = (n + \sqrt n )\log x^T y - \sum\limits_{i = 1}^n {\log x_i y_i } $$ by at least 0.2 in each iteration requiring O(n ³) arithmetic operations. If it starts from an interior feasible solution with the potential function value bounded by \(O(\sqrt n L)\) , it generates, in at most \(O(\sqrt n L)\) iterations, an approximate solution with the potential function value \( - O(\sqrt n L)\) , from which we can compute an exact solution in O(n ³) arithmetic operations. The algorithm is closely related with the central path following algorithm recently given by the authors. We also suggest a unified model for both potential reduction and path following algorithms for positive semi-definite linear complementarity problems.     

On diversity and stability of unit bases for the Euclidean metric

We prove the existence of a family Ω(n) of 2 ^c (where c is the cardinality of the continuum) subgraphs of the unit distance graph (E ⁿ , 1) of the Euclidean space E ⁿ , n ≥ 2, such that (a) for each graph G ? Ω(n), any homomorphism of G to (E ⁿ , 1) is an isometry of E ⁿ ; moreover, for each subgraph G ₀ of the graph G obtained from G by deleting less than c vertices, less than c stars, and less than c edges (we call such a subgraph reduced), any homomorphism of G ₀ to (E ⁿ , 1) is an isometry (of the set of the vertices of G ₀); (b) each graph G ? Ω(n) cannot be homomorphically mapped to any other graph of the family Ω(n), and the same is true for each reduced subgraph of G.     

Regular principal factors in free objects in varieties in the interval [B 2 ,NB 2 ∨G n ]

The author has shown previously how to associate a completely 0-simple semigroup with a connected bipartite graph containing labelled edges and how to describe the regular principal factors in the free objects in the Rees-Sushkevich varieties RS _n generated by all completely 0-simple semigroups over groups from the Burnside variety G _n of groups of exponent dividing a positive integer n by employing this graphical construction. Here we consider the analogous problem for varieties containing the variety B ₂ , generated by the five element Brandt semigroup B ₂, and contained in the variety NB ₂ ∨G _n where NB ₂ is the variety generated by all left and right zero semigroups together with B ₂. The interval [NB ₂ ,NB ₂ ∨G _n ] is of particular interest as it is an important interval, consisting entirely of varieties generated by completely 0-simple semigroups, in the lattice of subvarieties of RS _n .     

On rings whose number of centralizers of ideals is finite

LetR be a ring. For the setF of all nonzero ideals ofR, we introduce an equivalence relation inF as follows: For idealsI andJ, I～J if and only ifV _R (I)=V _R(J), whereV _R() is the centralizer inR. LetI _R=F/～. Then we can see thatn(I _R), the cardinality ofI _R, is 1 if and only ifR is either a prime ring or a commutative ring (Theorem 1.1). An idealI ofR is said to be a commutator ideal ifI is generated by{st?ts; s∈S, t∈T} for subsetS andT ofR, andR is said to be a ring with (N) if any commutator ideal contains no nonzero nilpotent ideals. Then we have the following main theorem: LetR be a ring with (N). Thenn(I _R) is finite if and only ifR is isomorphic to an irredundant subdirect sum ofS⊕Z whereS is a finite direct sum of non commutative prime rings andZ is a commutative ring (Theorem 2.1). Finally, we show that the existence of a ringR such thatn(I _R)=m for any given natural numberm.     

Some matrix functional equations

We investigate the pair of matrix functional equations G(x)F(y) = G(xy) and G(x)G(y) = F(y/x), featuring the two independent scalar variables x and y and the two N×N matrices F(z) andG(z) (with N an arbitrary positive integer and the elements of these two matrices functions of the scalar variable z). We focus on the simplest class of solutions, i.e., on matrices all of whose elements are analytic functions of the independent variable. While in the scalar (N = 1) case this pair of functional equations only possess altogether trivial constant solutions, in the matrix (N > 1) case there are nontrivial solutions. These solutions satisfy the additional pair of functional equations F(x)G(y) = G(y/x) andF(x)F(y) = F(xy), and an endless hierarchy of other functional equations featuring more than two independent variables.     

Homotopy type of smooth weighted complete intersections

If the total degree d has no prime divisors less than(n+3)/2,then we prove that the homotopy type of complex odd dimensional smooth weighted complete intersection Xn(d;w) is determined by the dimension n,the total degree d,the Euler characteristic and the Kervaire invariant,provided that the weights w =(ω0,...,ωn+r) is pairwise relatively prime.     

Convergence analysis of finite element methods for H(curl; Ω)-elliptic interface problems

In this article we investigate the analysis of a finite element method for solving H(curl; ??)-elliptic interface problems in general three-dimensional polyhedral domains with smooth interfaces. The continuous problems are discretized by means of the first family of lowest order Nédélec H(curl; ??)-conforming finite elements on a family of tetrahedral meshes which resolve the smooth interface in the sense of sufficient approximation in terms of a parameter ?? that quantifies the mismatch between the smooth interface and the triangulation. Optimal error estimates in the H(curl; ??)-norm are obtained for the first time. The analysis is based on a ??-strip argument, a new extension theorem for H ¹(curl; ??)-functions across smooth interfaces, a novel non-standard interface-aware interpolation operator, and a perturbation argument for degrees of freedom for H(curl; ??)-conforming finite elements. Numerical tests are presented to verify the theoretical predictions and confirm the optimal order convergence of the numerical solution.     

Fractal functions and interpolation

Let a data set {(x _i,y _i) ∈I×R;i=0,1,?,N} be given, whereI=[x ₀,x _N]?R. We introduce iterated function systems whose attractorsG are graphs of continuous functionsf∶I→R, which interpolate the data according tof(x _i)=y _i fori ε {0,1,?,N}. Results are presented on the existence, coding theory, functional equations and moment theory for such fractal interpolation functions. Applications to the approximation of naturally wiggly functions, which may show some kind of geometrical self-similarity under magnification, such as profiles of cloud tops and mountain ranges, are envisaged.     

Separability of wild automorphisms of a polynomial ring

For a large class (including the Nagata automorphism) of wild automorphisms F of k[x, y, z] (where k is a field of characteristic zero), we prove that we can find a weight w such that there exists no tame automorphism with the same w-weight multidegree.     

Existence and nonuniqueness of solutions to a functional-differential equation

We examine the functional-differential equation Δu(x) — div(u(H(x))f (x)) = 0 on a torus which is a generalization of the stationary Fokker-Planck equation. Under sufficiently general assumptions on the vector field f and the map H, we prove the existence of a nontrivial solution. In some cases the subspace of solutions is established to be multidimensional.     

The Euler characteristic and valuations on MV-algebras

Every finitely presented MV-algebra A has a unique idempotent valuation E assigning value 1 to every basic element of A. For each a ∈ A, E(a) turns out to coincide with the Euler characteristic of the open set of maximal ideals m of A such that a/m is nonzero.     

The 3D Incompressible Euler Equations with a Passive Scalar: A Road to Blow-Up?

The three-dimensional incompressible Euler equations with a passive scalar θ are considered in a smooth domain $\varOmega\subset \mathbb{R}^{3}$ with no-normal-flow boundary conditions $\boldsymbol{u}\cdot\hat{\boldsymbol{n}}|_{\partial\varOmega} = 0$ . It is shown that smooth solutions blow up in a finite time if a null (zero) point develops in the vector B=?q×?θ, provided B has no null points initially: $\boldsymbol{\omega} = \operatorname{curl}\boldsymbol {u}$ is the vorticity and q=ω??θ is a potential vorticity. The presence of the passive scalar concentration θ is an essential component of this criterion in detecting the formation of a singularity. The problem is discussed in the light of a kinematic result by Graham and Henyey (Phys. Fluids 12:744–746, 2000) on the non-existence of Clebsch potentials in the neighbourhood of null points.     

On diophantine equations of the form {({\boldsymbol x}-{\boldsymbol a}_{\bf 1})({\boldsymbol x}-{\boldsymbol a}_{\bf 2}) \ldots ({\boldsymbol x}-{\boldsymbol a}_{\boldsymbol k}) + {\boldsymbol r} = {\boldsymbol y}^{ \boldsymbol n}}

Erd?s and Selfridge [3] proved that a product of consecutive integers can never be a perfect power. That is, the equation x(x?+?1)(x?+?2)...(x?+?(m???1))?=?y ⁿ has no solutions in positive integers x,m,n where m, n?>?1 and y?∈?Q. We consider the equation $$ (x-a_1)(x-a_2) \ldots (x-a_k) + r = y^n $$ where 0?≤?a ₁?<?a ₂?<???<?a _k are integers and, with r?∈?Q, n?≥?3 and we prove a finiteness theorem for the number of solutions x in Z, y in Q. Following that, we show that, more interestingly, for every nonzero integer n?>?2 and for any nonzero integer r which is not a perfect n-th power for which the equation admits solutions, k is bounded by an effective bound.     

The K-moment problem with densities

Given a compact basic semi-algebraic set ${\mathbf{K}} \subset {\mathbb{R}}^n$ , a rational fraction $f:{\mathbb{R}}^n\to{\mathbb{R}}$ , and a sequence of scalars y = (y _α), we investigate when $y_\alpha =\int_{\mathbf{K}} x^\alpha f\,d\mu$ holds for all $\alpha\in{\mathbb{N}}^n$ , i.e., when y is the moment sequence of some measure fdμ, supported on K. This yields a set of (convex) linear matrix inequalities (LMI). We also use semidefinite programming to develop a converging approximation scheme to evaluate the integral ∫ fdμ when the moments of μ are known and f is a given rational fraction. Numerical expreriments are also provided. We finally provide (again LMI) conditions on the moments of two measures $\nu,\mu$ with support contained in K, to have $d\nu=f d\mu$ for some rational fraction f.