(3,k)-Factor-Critical Graphs and Toughness

 A graph is (r,k)-factor-critical if the removal of any set of k vertices results in a graph with an r-factor (i.e. an r-regular spanning subgraph). Let t(G) denote the toughness of graph G. In this paper, we show that if t(G)≥4, then G is (3,k)-factor-critical for every non-negative integer k such that n+k even, k<2 t(G)−2 and k≤n−7. Revised: September 21, 1998     

Piecewise Hereditary Nakayama Algebras

Let k be an algebraically closed field. Let Λ be the path algebra over k of the linearly oriented quiver \mathbb A_n\mathbb A_n for n ≥ 3. For r ≥ 2 and n > r we consider the finite dimensional k −algebra Λ(n,r) which is defined as the quotient algebra of Λ by the two sided ideal generated by all paths of length r. We will determine for which pairs (n,r) the algebra Λ(n,r) is piecewise hereditary, so the bounded derived category D ^b (Λ(n,r)) is equivalent to the bounded derived category of a hereditary abelian category H\mathcal H as triangulated category.     

Asymptotic Upper Bounds for Ramsey Functions

 We show that for any graph G with N vertices and average degree d, if the average degree of any neighborhood induced subgraph is at most a, then the independence number of G is at least Nf _{a +1}(d), where f _{a +1}(d)=∫₀ ¹(((1−t)^{1/( a +1)})/(a+1+(d−a−1)t))dt. Based on this result, we prove that for any fixed k and l, there holds r(K _k + _l ,K _n )≤ (l+o(1))n ^k /(logn) ^{k −1}. In particular, r(K _k , K _n )≤(1+o(1))n ^{k −1}/(log n) ^{k −2}. Received: May 11, 1998 Final version received: March 24, 1999     

Probabilities of high excursions of Gaussian fields

Let {ξ(t), t ∈ T} be a differentiable (in the mean-square sense) Gaussian random field with E ξ(t) ≡ 0, D ξ(t) ≡ 1, and continuous trajectories defined on the m-dimensional interval T ì \mathbbR^m T \subset {\mathbb{R}^m} . The paper is devoted to the problem of large excursions of the random field ξ. In particular, the asymptotic properties of the probability P = P{−v(t) < ξ(t) < u(t), t ∈ T}, when, for all t ∈ T, u(t), v(t) ⩾ χ, χ → ∞, are investigated. The work is a continuation of Rudzkis research started in [R. Rudzkis, Probabilities of large excursions of empirical processes and fields, Sov. Math., Dokl., 45(1):226–228, 1992]. It is shown that if the random field ξ satisfies certain smoothness and regularity conditions, then P = e^−Q  + Qo(1), where Q is a certain constructive functional depending on u, v, T, and the matrix function R(t) = cov(ξ′(t), ξ′(t)).     

Integral representation of even positive-definite functions of two variables

We obtain an integral representation of even functions of two variables for which the kernel [k ₁(x + y) + k ₂(x − y)], x, y ∈ R ², is positive definite.     

Piecewise-linear,discontinuous Galerkin method for a fractional diffusion equation

We use a piecewise-linear, discontinuous Galerkin method for the time discretization of a fractional diffusion equation involving a parameter in the range − 1 < α < 0. Our analysis shows that, for a time interval (0,T) and a spatial domain Ω, the error in L_￥((0,T);L₂(W))L_\infty\bigr((0,T);L_2(\Omega)\bigr) is of order k ^2 + α , where k denotes the maximum time step. Since derivatives of the solution may be singular at t = 0, our result requires the use of non-uniform time steps. In the limiting case α = 0 we recover the known O(k ²) convergence for the classical diffusion (heat) equation. We also consider a fully-discrete scheme that employs standard (continuous) piecewise-linear finite elements in space, and show that the additional error is of order h ²log(1/k). Numerical experiments indicate that our O(k ^2 + α ) error bound is pessimistic. In practice, we observe O(k ²) convergence even for α close to − 1.     

Diagnostic tests for local coalescences of variables in Boolean functions

The article studies diagnostic tests for local k -fold coalescences of variables in Boolean functions f( [(x)\tilde]ⁿ )( 1 ￡ k ￡ n,  1 ￡ t ￡ 2^2k ) f\left( {{{\tilde{x}}^n}} \right)\left( {1 \leq k \leq n,\;1 \leq t \leq {2^{{2^k}}}} \right) . Upper and lower bounds are proved for the Shannon function of the length of the diagnostic test for local k -fold coalescences generated by the system of functions F_t^k \Phi_t^k . The Shannon function of the length of a complete diagnostic test for local k -fold coalescences behaves asymptotically as 2 ^k (n − k + 1) for n → ∞, k → ∞.     

Multiple points of trajectories of multiparameter fractional Brownian motion

Consider 0<α<1 and the Gaussian process Y(t) on ℝ ^N with covariance E(Y(s)Y(t))=|t|^2α+|s|^2α−|t−s|^2α, where |t| is the Euclidean norm of t. Consider independent copies X ¹,…,X ^d of Y and␣the process X(t)=(X ¹(t),…,X ^d (t)) valued in ℝ ^d . When kN≤␣(k−1)αd, we show that the trajectories of X do not have k-multiple points. If N<αd and kN>(k−1)αd, the set of k-multiple points of the trajectories X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^{k N /α−( k −1) d} (loglog(1/ɛ)) ^k . If N=αd, we show that the set of k-multiple points of the trajectories of X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^d (log(1/ɛ) logloglog 1/ɛ) ^k . (This includes the case k=1.) Received: 20 May 1997 / Revised version: 15 May 1998     

Bichromatic and Equichromatic Lines in ℂ2 and ℝ2

Let G and R each be a finite set of green and red points, respectively, such that |G|=n, |R|=n−k, G∩R=∅, and the points of G∪R are not all collinear. Let t be the total number of lines determined by G∪R. The number of equichromatic lines (a subset of bichromatic) is at least (t+2n+3−k(k+1))/4. A slightly weaker lower bound exists for bichromatic lines determined by points in ℂ². For sufficiently large point sets, a proof of a conjecture by Kleitman and Pinchasi is provided. A lower bound of (2t+14n−k(3k+7))/14 is demonstrated for bichromatic lines passing through at most six points. Lower bounds are also established for equichromatic lines passing through at most four, five, or six points.     

Kakeya-type sets in finite vector spaces

For a finite vector space V and a nonnegative integer r≤dim V, we estimate the smallest possible size of a subset of V, containing a translate of every r-dimensional subspace. In particular, we show that if K⊆V is the smallest subset with this property, n denotes the dimension of V, and q is the size of the underlying field, then for r bounded and r<n≤rq ^r−1, we have |V∖K|=Θ(nq ^n−r+1); this improves the previously known bounds |V∖K|=Ω(q ^n−r+1) and |V∖K|=O(n ² q ^n−r+1).     

Differential-geometric structures on generalized Reidemeister and Bol three-webs

In this paper, we present the main results of the study of multidimensional three-websW(p, q, r) obtained by the method of external forms and moving Cartan frame. The method was developed by the Russian mathematicians S. P. Finikov, G. F. Laptev, and A. M. Vasiliev, while fundamentals of differential-geometric (p, q, r)-webs theory were described by M. A. Akivis and V. V. Goldberg. Investigation of (p, q, r)-webs, including algebraic and geometric theory aspects, has been continued in our papers, in particular, we found the structure equations of a three-web W(p, q, r), where p = λl, q = λm, and r = λ(l + m − 1). For such webs, we define the notion of a generalized Reidemeister configuration and proved that a three-web W(λl, λm, λ(l + m − 1)), on which all sufficiently small generalized Reidemeister configurations are closed, is generated by a λ-dimensional Lie group G. The structure equations of the web are connected with the Maurer–Cartan equations of the group G. We define generalized Reidemeister and Bol configurations for three-webs W(p, q, q). It is proved that a web W(p, q, q) on which generalized Reidemeister or Bol configurations are closed is generated, respectively, by the action of a local smooth q-parametric Lie group or a Bol quasigroup on a smooth p-dimensional manifold. For such webs, the structure equations are found and their differential-geometric properties are studied.     

Some combinatorial constructions for optimal perfect deletion-correcting codes

There are two kinds of perfect t-deletion-correcting codes of length k over an alphabet of size v, those where the coordinates may be equal and those where all coordinates must be different. We call these two kinds of codes T*(k − t, k, v)-codes and T(k − t, k, v)-codes respectively. The cardinality of a T(k − t, k, v)-code is determined by its parameters, while T*(k − t, k, v)-codes do not necessarily have a fixed size. Let N(k − t, k, v) denote the maximum number of codewords in any T*(k − t, k, v)-code. A T*(k − t, k, v)-code with N(k − t, k, v) codewords is said to be optimal. In this paper, some combinatorial constructions for optimal T*(2, k, v)-codes are developed. Using these constructions, we are able to determine the values of N(2, 4, v) for all positive integers v. The values of N(2, 5, v) are also determined for almost all positive integers v, except for v = 13, 15, 19, 27 and 34.      

An extremal set theoretical characterization of some steiner systems

Letn, k, t be integers,n>k>t≧0, and letm(n, k, t) denote the maximum number of sets, in a family ofk-subsets of ann-set, no two of which intersect in exactlyt elements. The problem of determiningm(n, k, t) was raised by Erdős in 1975. In the present paper we prove that ifk≦2t+1 andk−t is a prime, thenm(n, k, t)≦( _t ⁿ )( _k ^2k-t-1 )/( _t ^2k-t-1 ). Moreover, equality holds if and only if an (n, 2k−t−1,t)-Steiner system exists. The proof uses a linear algebraic approach.     

Anharmonic Oscillators in the Complex Plane, $\boldsymbol{\mathcal{PT}}$-symmetry,and Real Eigenvalues

For integers m ≥ 3 and 1 ≤ ℓ ≤ m − 1, we study the eigenvalue problems − u ^″(z) + [( − 1)^ℓ(iz) ^m  − P(iz)]u(z) = λu(z) with the boundary conditions that u(z) decays to zero as z tends to infinity along the rays argz=-\fracp2±\frac(l+1)pm+2\arg z=-\frac{\pi}{2}\pm \frac{(\ell+1)\pi}{m+2} in the complex plane, where P is a polynomial of degree at most m − 1. We provide asymptotic expansions of the eigenvalues λ _n . Then we show that if the eigenvalue problem is PT\mathcal{PT}-symmetric, then the eigenvalues are all real and positive with at most finitely many exceptions. Moreover, we show that when gcd(m,l)=1\gcd(m,\ell)=1, the eigenvalue problem has infinitely many real eigenvalues if and only if one of its translations or itself is PT\mathcal{PT}-symmetric. Also, we will prove some other interesting direct and inverse spectral results.     

Integral representation of even positive-definite functions of one variable

We obtain an integral representation of even positive-definite functions of one variable for which the kernel [k ₁(x + y) + k ₂ (x − y)] is positive definite.     

The primes contain arbitrarily long polynomial progressions

We establish the existence of infinitely many polynomial progressions in the primes; more precisely, given any integer-valued polynomials P ₁, …, P _k  ∈ Z[m] in one unknown m with P ₁(0) = … = P _k (0) = 0, and given any ε > 0, we show that there are infinitely many integers x and m, with 1 \leqslant m \leqslant x^e1 \leqslant m \leqslant x^\varepsilon, such that x + P ₁(m), …, x + P _k (m) are simultaneously prime. The arguments are based on those in [18], which treated the linear case P _j  = (j − 1)m and ε = 1; the main new features are a localization of the shift parameters (and the attendant Gowers norm objects) to both coarse and fine scales, the use of PET induction to linearize the polynomial averaging, and some elementary estimates for the number of points over finite fields in certain algebraic varieties.     

New approach to the numerical solution of forward-backward equations

This paper is concerned with the approximate solution of functional differential equations having the form: x′(t) = αx(t) + βx(t - 1) + γx(t + 1). We search for a solution x, defined for t ∈ [−1, k], k ∈ ℕ, which takes given values on intervals [−1, 0] and (k-1, k]. We introduce and analyse some new computational methods for the solution of this problem. Numerical results are presented and compared with the results obtained by other methods.      

Stokes and Navier–Stokes problems in a half-space: the existence and uniqueness of solutions a priori nonconvergent to a limit at infinity

The Cauchy problem and the initial boundary value problem in the half-space of the Stokes and Navier–Stokes equations are studied. The existence and uniqueness of classical solutions (u, π) (considered at least C ² × C ¹ smooth with respect to the space variable and C ¹ × C ⁰ smooth with respect to the time variable) without requiring convergence at infinity are proved. A priori the fields u and π are nondecreasing at infinity. In the case of the Stokes problem, the existence, for any t > 0, and the uniqueness of solutions with kinetic field and pressure field are established for some β ∈ (0, 1) and γ ∈ (0, 1 − β). In the case of Navier–Stokes equations, the existence (local in time) and the uniqueness of classical solutions to the Navier–Stokes equations are shown under the assumption that the initial data are only continuous and bounded, by proving that, for any t ∈ (0, T), the kinetic field u(x, t) is bounded and, for any γ ∈ (0, 1), the pressure field π(x, t) is O(1 + |x| ^γ ). Bibliography: 20 titles. To V. A. Solonnikov on his 75th birthday Published in Zapiski Nauchnykh Seminarov POMI, Vol. 362, 2008, pp. 176–240.     

On numerical experiments with symmetric semigroups generated by three elements and their generalization

We give a simple explanation of numerical experiments of V. Arnold with two sequences of symmetric numerical semigroups, S(4,6+4k,87−4k) and S(9,3+9k,85−9k) generated by three elements. We present a generalization of these sequences by numerical semigroups S(r₁²,r₁r₂+r₁²k,r₃-r₁²k)\mathsf{S}(r_{1}^{2},r_{1}r_{2}+r_{1}^{2}k,r_{3}-r_{1}^{2}k), k∈ℤ, r ₁,r ₂,r ₃∈ℤ⁺, r ₁≥2 and gcd(r ₁,r ₂)=gcd(r ₁,r ₃)=1, and calculate their universal Frobenius number Φ(r ₁,r ₂,r ₃) for the wide range of k providing semigroups be symmetric. We show that this type of semigroups admit also nonsymmetric representatives. We describe the reduction of the minimal generating sets of these semigroups up to {r₁²,r₃-r₁²k}\{r_{1}^{2},r_{3}-r_{1}^{2}k\} for sporadic values of k and find these values by solving the quadratic Diophantine equation.     

On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations

An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y {0,1}ⁿ, d_H (f(x), f(y)) ≥ d_H (x, y) + d, if d_H (x, y) ≤ (n + k) − d and d_H (f(x), f(y)) = n + k, if d_H (x, y) > (n + k) − d. In this paper, we construct an (n,3,2)-mapping for any positive integer n ≥ 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P(n, r) denote the maximum size of an (n, r)-permutation array and A(n, r) denote the same setting for binary codes. Applying (n,3,2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode) with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359–365, Chang et al. (2003). IEEE Trans Inf Theory 49:1054–1059; Huang et al. (submitted)]. More precisely, we obtain that, for n ≥ 8, P(n, r) ≥ A(n − 2, r − 3) > A(n − 1,r − 2) = A(n, r − 1) when n is even and P(n, r) ≥ A(n − 2, r − 3) = A(n − 1, r − 2) > A(n, r − 1) when n is odd. This improves the best bound A(n − 1,r − 2) so far [Huang et al. (submitted)] for n ≥ 8. The work was supported in part by the National Science Council of Taiwan under contract NSC-93-2213-E-009-117