Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

The support of an [n, k] linear code C over a finite field F_q is the set of all coordinate positions such that at least one codeword has a nonzero entry in each of these coordinate position. The rth generalized Hamming weight d_r(C), 1 ⩽ r ⩽ k, of C is defined as the minimum of the cardinalities of the supports of all [n, r] subcodes of C. The sequence (d₁(C), d₂(C), … , d_k(C)) is called the Hamming weight hierarchy (HWH) of C. The HWH, d_r(C) = n − k + r;  r = 1, 2 , …, k, characterizes maximum distance separable (MDS) codes. Therefore the matrix characterization of MDS codes is also the characterization of codes with the HWH d_r(C) = n − k + r; r = 1, 2, … , k. A linear code C with systematic check matrix [I∣P], where I is the (n − k) × (n − k) identity matrix and P is a (n − k) × k matrix, is MDS iff every square submatrix of P is nonsingular. In this paper we extend this characterization to linear codes with arbitrary HWH. Using this result, we characterize Near-MDS codes, Near-Near-MDS (N²-MDS) codes and A^μ-MDS codes. The MDS-rank of C is the smallest integer η such that d_η+1 = n − k + η + 1 and the defect vector of C with MDS-rank η is defined as the ordered set {μ₁(C), μ₂(C), μ₃(C), … , μ_η(C), μ_η+1(C)}, where μ_i(C) = n − k + i − d_i(C). We call C a dually defective code if the defect vector of the code and its dual are the same. We also discuss matrix characterization of dually defective codes. Further, the codes meeting the generalized Greismer bound are characterized in terms of their generator matrix. The HWH of dually defective codes meeting the generalized Greismer bound are also reported.     

Complexity Estimates for the Schmüdgen Positivstellensatz

LetKbe a closed basic set inRⁿgiven by the polynomial inequalities φ₁≥ 0, . . . , φ_m≥ 0 and let Σ be the semiring generated by the φ_kand the squares inR[x₁, . . . ,x_n]. Schmüdgen has shown that ifKis compact then any polynomial function strictly positive onKbelongs to Σ. Easy consequences are (1)f≥ 0 onKif and only iff∈R⁺+ Σ (Positivstellensatz) and (2) iff≥ 0 onKbutf∈ Σ then asdtends to 0⁺, in any representation off + das an element of Σ in terms of the φ_k, the squares and semiring operations, the integerN(d) which is the minimum over all representations of the maximum degree of the summands must become arbitrarily large. A one-dimensional example is analyzed to obtain asymptotic lower and upper bounds of the formcd^−1/2≤N(d) ≤Cd^−1/2log (1/d).     

Characterizations of PG(n − 1, q)\PG(k − 1, q) by Numerical and Polynomial Invariants

We show that the simple matroid PG(n − 1, q)\PG(k − 1, q), for n ≥ 4 and 1 ≤ k ≤ n − 2, is characterized by a variety of numerical and polynomial invariants. In particular, any matroid that has the same Tutte polynomial as PG(n − 1, q)\PG(k − 1, q) is isomorphic to PG(n − 1, q)\PG(k − 1, q).     

On generalized Jordan 1-derivation in rings

Let n ⩾ 1 be a fixed integer and let R be an (n + 1)!-torsion free 1-ring with identity element e. If F, d:R → R are two additive mappings satisfying F(xⁿ⁺¹) = F(x)(x¹)ⁿ + xd(x)(x¹)ⁿ⁻¹ + x²d(x)(x¹)ⁿ⁻²+ ⋯ +xⁿd(x) for all x ∈ R, then d is a Jordan 1-derivation and F is a generalized Jordan 1-derivation on R.     

On Certain C-Test Words for Free Groups

Let F_m be a free group of a finite rank m ≥ 2 and let X_i, Y_j be elements in F_m. A non-empty word w(x₁,…,x_n) is called a C-test word in n letters for F_m if, whenever (X₁,…,X_n) = w(Y₁,…,Y_n) ≠ 1, the two n-typles (X₁,…,X_n) and (Y₁,…,Y_n) are conjugate in F_m. In this paper we construct, for each n ≥ 2, a C-test word v_n(x₁,…,x_n) with the additional property that v_n(X₁,…,X_n) = 1 if and only if the subgroup of F_m generated by X₁,…,X_n is cyclic. Making use of such words v_m(x₁,…,x_m) and v_m + 1(x₁,…,x_m + 1), we provide a positive solution to the following problem raised by Shpilrain: There exist two elements u₁, u₂ ∈ F_m such that every endomorphism ψ of F_m with non-cyclic image is completely determined by ψ(u₁), ψ(u₂).     

A semi-Markov process with an inverse Gaussian distribution as sojourn time

Let X_n denote the state of a device after n repairs. We assume that the time between two repairs is the time τ taken by a Wiener process {W(t), t ? 0}, starting from w₀ and with drift μ < 0, to reach c ∈ [0, w₀). After the nth repair, the process takes on either the value X_n?1 + 1 or X_n?1 + 2. The probability that X_n = X_n?1 + j, for j = 1, 2, depends on whether τ ? t₀ (a fixed constant) or τ > t₀. The device is considered to be worn out when X_n ? k, where k ∈ {1, 2, …}. This model is based on the ones proposed by Rishel (1991) [1] and Tseng and Peng (2007) [2]. We obtain an explicit expression for the mean lifetime of the device. Numerical methods are used to illustrate the analytical findings.     

The Exponent of Discrepancy Is at Least 1.0669

LetP⊂[0, 1]^dbe ann-point set and letw: P→[0, ∞) be a weight function withw(P)=∑_z∈P w(z)=1. TheL₂-discrepancy of the weighted set (P, w) is defined as theL₂-average ofD(x)=vol(B_x)−w(P∩B_x) overx∈[0, 1]^d, where vol(B_x) is the volume of thed-dimensional intervalB_x=∏^d_k=1 [0, x_k). The exponent of discrepancyp* is defined as the infimum of numberspsuch that for all dimensionsd⩾1 and allε>0 there exists a weighted set of at mostKε^−ppoints in [0, 1]^dwithL₂-discrepancy at mostε, whereK=K(p) is a suitable number independent ofεandd. Wasilkowski and Woźniakowski proved thatp*⩽1.4779, by combining known bounds for the error of numerical integration and using their relation toL₂-discrepancy. In this note we observe that a careful treatment of a classical lower- bound proof of Roth yieldsp*⩾1.04882, and by a slight modification of the proof we getp*⩾1.0669. Determiningp* exactly seems to be quite a difficult problem.     

New exact solitary-wave special solutions for the nonlinear dispersive K(m, n) equations

In this paper, we study the nonlinear dispersive K(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxx = 0 which exhibit solutions with solitary patterns. New exact solitary solutions are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. The nonlinear equations K(m, n) are studied for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of K(m, n) equations are established.     

An extended rational interpolation method

To interpolate function, f(x), a ? x ? b, when we have some information about the values of f(x) and their derivatives in separate points on {x₀, x₁, … , x_n} ? [a, b], the Hermit interpolation method is usually used. Here, to solve this kind of problems, extended rational interpolation method is presented and it is shown that the suggested method is more efficient and suitable than the Hermit interpolation method, especially when the function f(x) has singular points in interval [a, b]. Also for implementing the extended rational interpolation method, the direct method and the inverse differences method are presented, and with some examples these arguments are examined numerically.     

Calculation of a static potential created by plane fractal cluster

In this paper we demonstrate new approach that can help in calculation of electrostatic potential of a fractal (self-similar) cluster that is created by a system of charged particles. For this purpose we used the simplified model of a plane dendrite cluster [1] that is generated by a system of the concentric charged rings located in some horizontal plane (see Fig. 2). The radiuses and charges of the system of concentric rings satisfy correspondingly to relationships: r_n = r₀ξⁿ and e_n = e₀bⁿ, where n determines the number of a current ring. The self-similar structure of the system considered allows to reduce the problem to consideration of the functional equation that similar to the conventional scaling equation. Its solution represents itself the sum of power-low terms of integer order and non-integer power-law term multiplied to a log-periodic function [5], [6]. The appearance of this term was confirmed numerically for internal region of the self-similar cluster (r₀ ≪ r ≪ r_N−1), where r₀, r_N−1 determine the smallest and the largest radiuses of the limiting rings correspondingly. The results were obtained for homogeneously (b > 0) and heterogeneously (b < 0) charged rings. We expect that this approach allows to consider more complex self-similar structures with different geometries of charge distributions.     

An exact algorithm for the knapsack sharing problem with common items

We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As usual, each item is associated with its profit and weight, and the problem is to determine the subset of items to be packed into the knapsack. However, in the problem there are s players and the items are divided into s + 1 disjoint groups, N_k (k = 0, 1, … , s). The player k is concerned only with the items in N₀ ∪ N_k, where N₀ is the set of ‘common’ items, while N_k represents the set of his own items. The problem is to maximize the minimum of the profits of all the players. An algorithm is developed to solve this problem to optimality, and through a series of computational experiments, we evaluate the performance of the developed algorithm.     

Quantum Complexity of Integration

It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hölder classes F^k, α_d on [0, 1]^d and define γ by γ=(k+α)/d. The known optimal orders for the complexity of deterministic and (general) randomized methods are comp(F^k, α_d, ε)≍ε^−1/γ and comp^random(F^k, α_d, ε)≍ε^−2/(1+2γ). For a quantum computer we prove comp^quant_query(F^k, α_d, ε)≍ε^−1/(1+γ) and comp^quant(F^k, α_d, ε)⩽Cε^−1/(1+γ)(log ε⁻¹)^1/(1+γ). For restricted Monte Carlo (only coin tossing instead of general random numbers) we prove comp^coin(F^k, α_d, ε)⩽Cε^−2/(1+2γ)(log ε⁻¹)^1/(1+2γ). To summarize the results one can say that   • there is an exponential speed-up of quantum algorithms over deterministic (classical) algorithms, if γ is small;   • there is a (roughly) quadratic speed-up of quantum algorithms over randomized classical methods, if γ is small.     

Computing best-possible bounds for the distribution of a sum of several variables is NP-hard

In many real-life situations, we know the probability distribution of two random variables x₁ and x₂, but we have no information about the correlation between x₁ and x₂; what are the possible probability distributions for the sum x₁ + x₂? This question was originally raised by A.N. Kolmogorov. Algorithms exist that provide best-possible bounds for the distribution of x₁ + x₂; these algorithms have been implemented as a part of the efficient software for handling probabilistic uncertainty. A natural question is: what if we have several (n > 2) variables with known distribution, we have no information about their correlation, and we are interested in possible probability distribution for the sum y = x₁ + ⋯ + x_n? Known formulas for the case n = 2 can be (and have been) extended to this case. However, as we prove in this paper, not only are these formulas not best-possible anymore, but in general, computing the best-possible bounds for arbitrary n is an NP-hard (computationally intractable) problem.     

Special Functions on the Sphere with Applications to Minimal Surfaces

A function which is homogeneous in x, y, z of degree n and satisfies V_xx + V_yy + V_zz = 0 is called a spherical harmonic. In polar coordinates, the spherical harmonics take the form rⁿf_n, where f_n is a spherical surface harmonic of degree n. On a sphere, f_n satisfies ▵ f_n + n(n + 1)f_n = 0, where ▵ is the spherical Laplacian. Bounded spherical surface harmonics are well studied, but in certain instances, unbounded spherical surface harmonics may be of interest. For example, if X is a parameterization of a minimal surface and n is the corresponding unit normal, it is known that the support function, w = X · n, satisfies ▵w + 2w = 0 on a branched covering of a sphere with some points removed. While simple in form, the boundary value problem for the support function has a very rich solution set. We illustrate this by using spherical harmonics of degree one to construct a number of classical genus-zero minimal surfaces such as the catenoid, the helicoid, Enneper's surface, and Hennenberg's surface, and Riemann's family of singly periodic genus-one minimal surfaces.     

Quantifying exponential growth: Three conceptual shifts in coordinating multiplicative and additive growth

This article presents the results of a teaching experiment with middle school students who explored exponential growth by reasoning with the quantities height (y) and time (x) as they explored the growth of a plant. Three major conceptual shifts occurred during the course of the teaching experiment: (1) from repeated multiplication to initial coordination of multiplicative growth in y with additive growth in x; (2) from coordinating growth in y with growth in x to coordinated constant ratios (determining the ratio of f(x₂) to f(x₁) for corresponding intervals of time for (x₂ − x₁) ≥ 1), and (3) from coordinated constant ratios to within-units coordination for corresponding intervals of time for (x₂ − x₁) < 1. Each of the three shifts is explored along with a discussion of the ways in which students’ mathematical activity supported movement from one stage of understanding to the next. These findings suggest that emphasizing a coordination of multiplicative and additive growth for exponentiation may support students’ abilities to flexibly move between the covariation and correspondence views of function.     

Interpolation by Integer-Valued Polynomials

LetRbe a Krull ring with quotient fieldKanda₁,…,a_ninR. If and only if thea_iare pairwise incongruent mod every height 1 prime ideal of infinite index inRdoes there exist for all valuesb₁,…,b_ninRan interpolating integer-valued polynomial, i.e., anf ∈ K[x] withf(a_i) = b_iandf(R) ⊆ R.IfSis an infinite subring of a discrete valuation ringR_vwith quotient fieldKanda₁,…,a_ninSare pairwise incongruent mod allM^k_v ∩ Sof infinite index inS, we also determine the minimald(depending on the distribution of thea_iamong residue classes of the idealsM^k_v ∩ S) such that for allb₁,…,b_n ∈ R_vthere exists a polynomialf ∈ K[x] of degree at mostdwithf(a_i) = b_iandf(S) ⊆ R_v.     

Vacuum polarization in light two-electron atoms and ions

A general theory of the vacuum polarization in light atomic and muon-atomic systems is considered. We derive the closed analytical expression for the Uehling potential and evaluate corrections on vacuum polarization for the 1¹S-state of the two-electron ³He and ⁴He atoms and for some two-electron ions, including the Li⁺, Be²⁺, B³⁺ and C⁴⁺ ions. The correction for vacuum polarization in two-electron He atoms has been evaluated as ΔE_ueh ≈ 7.253 ± 0.0025 × 10⁻⁷ a.u. The analogous corrections in the two-electron He-like ions rapidly increase with the nuclear charge Q (ΔE_ueh ≈ 2.7061 × 10⁻⁶ a.u. for the Li⁺ ion and ΔE_ueh ≈ 2.3495 × 10⁻⁵ a.u. for the C⁴⁺ ion). The corresponding corrections have also been evaluated for the electron–nucleus and electron–electron interactions.