Asymptotics of the Velocity Potential of an Ideal Fluid Flowing around a Thin Body

We consider the Neumann problem outside a small neighborhood of a planar disk in the three-dimensional space. The surface of this neighborhood is assumed to be smooth, and its thickness is characterized by a small parameter ε. A uniform asymptotic expansion of the solution of this problem with respect to ε is constructed by the matching method. Since the problem turned out to be bisingular, an additional inner asymptotic expansion in the so-called stretched variables is constructed near the edge of the disk. A physical interpretation of the solution of this boundary value problem is the velocity potential of a laminar flow of an ideal fluid around a thin body, which is the neighborhood of the disk. It is assumed that this flow has unit velocity at a large distance from the disk, which is equivalent to the following condition for the potential: u(x₁, x₂, x₃, ε) = x₃+O(r^?2) as r → ∞, where r is the distance to the origin. The boundary condition of this problem is the impermeability of the surface of the body: ?u/?n = 0 at the boundary. After subtracting x₃ from the solution u(x₁, x₂, x₃, ε), we get a boundary value problem for the potential ?(x₁, x₂, x₃, ε) of the perturbed motion. Since the integral of the function ??/?n over the surface of the body is zero, we have ?(x₁, x₂, x₃, ε) = O(r^?2) as r → ∞. Hence, all the coefficients of the outer asymptotic expansion with respect to ε have the same behavior at infinity. However, these coefficients have growing singularities at the approach to the edge of the disk, which implies the bisingularity of the problem.     

Packing circles in the smallest circle: an adaptive hybrid algorithm

The circular packing problem (CPP) consists of packing n circles C _i of known radii r _i , i∈N={1,?…,?n}, into the smallest containing circle ?. The objective is to determine the coordinates (x _i ,?y _i ) of the centre of C _i , i∈N, as well as the radius r and centre (x,?y) of ?. CPP, which is a variant of the two-dimensional open-dimension problem, is NP hard. This paper presents an adaptive algorithm that incorporates nested partitioning within a tabu search and applies some diversification strategies to obtain a (near) global optimum. The tabu search is to identify the n circles’ ordering, whereas the nested partitioning is to determine the n circles’ positions that yield the smallest r. The computational results show the efficiency of the proposed algorithm.     

On an open problem of Guo-Skiba

Let G be a finite group, and let A be a proper subgroup of G. Then any chief factor H/A _G of G is called a G-boundary factor of A. For any Gboundary factor H/A _G of A, the subgroup (A ∩ H)/A _G of G/ A _G is called a G-trace of A. In this paper, we prove that G is p-soluble if and only if every maximal chain of G of length 2 contains a proper subgroup M of G such that either some G-trace of M is subnormal or every G-boundary factor of M is a p′-group. This result give a positive answer to a recent open problem of Guo and Skiba. We also give some new characterizations of p-hypercyclically embedded subgroups.     

Block partitions: an extended view

Given a sequence \({S=(s_1, \ldots,s_m) \in [0, 1]^m}\), a block B of S is a subsequence \({B=(s_i,s_{i+1}, \ldots,s_j)}\). The size b of a block B is the sum of its elements. It is proved in [1] that for each positive integer n, there is a partition of S into n blocks B₁, \({\ldots,}\) B _n with \({|b_i - b_j| \le 1}\) for every i, j. In this paper, we consider a generalization of the problem in higher dimensions.     

The optimal solution set of the interval linear programming problems

Several methods exist for solving the interval linear programming (ILP) problem. In most of these methods, we can only obtain the optimal value of the objective function of the ILP problem. In this paper we determine the optimal solution set of the ILP as the intersection of some regions, by the best and the worst case (BWC) methods, when the feasible solution components of the best problem are positive. First, we convert the ILP problem to the convex combination problem by coefficients 0 ≤ λ _j , μ _ij , μ _i  ≤ 1, for i = 1, 2, . . . , m and j = 1, 2, . . . , n. If for each i, j, μ _ij  = μ _i  = λ _j  = 0, then the best problem has been obtained (in case of minimization problem). We move from the best problem towards the worst problem by tiny variations of λ _j , μ _ij and μ _i from 0 to 1. Then we solve each of the obtained problems. All of the optimal solutions form a region that we call the optimal solution set of the ILP. Our aim is to determine this optimal solution set by the best and the worst problem constraints. We show that some theorems to validity of this optimal solution set.     

Depth of Boolean functions over an arbitrary infinite basis

Realization of Boolean functions by circuits is considered over an arbitrary infinite complete basis. The depth of a circuit is defined as the greatest number of functional elements constituting a directed path from an input of the circuit to its output. The Shannon function of the depth is defined for a positive integer n as the minimal depth D _B (n) of the circuits sufficient to realize every Boolean function on n variables over a basis B. It is shown that, for each infinite basis B, either there exists a constant β ? 1 such that D _B (n) = β for all sufficiently large n or there exist an integer constant γ ? 2 and a constant δ such that log _γ n ? D _B (n) ? log _γ n + δ for all n.     

Expanding operators for the independent set problem

The notion is introduced of an expanding operator for the independent set problem. This notion is a useful tool for the constructive formation of new cases with the efficient solvability of this problem in the family of hereditary classes of graphs and is applied to hereditary parts of the set Free({P ₅, C ₅}). It is proved that if for a connected graph G the problem is polynomial-time solvable in the class Free({P ₅, C ₅,G}) then it remains so in the class Free({P ₅, C ₅,G ○ \(\bar K_2 \), G ⊕ K _1,p ) for every p. We also find two new hereditary subsets of Free({P ₅, C ₅}) with polynomially solvable independent set problem that are not a corollary of applying the revealed operators.     

A Minimum Principle for Potentials with Application to Chebyshev Constants

For “Riesz-like” kernels K(x,y) = f(|x?y|) on A×A, where A is a compact d-regular set \(A\subset \mathbb {R}^{p}\), we prove a minimum principle for potentials \(U_{K}^{\mu }=\int K(x,y)\textup {d}\mu (x)\), where μ is a Borel measure supported on A. Setting \(P_{K}(\mu )=\inf _{y\in A}U^{\mu }(y)\), the K-polarization of μ, the principle is used to show that if {ν _N } is a sequence of measures on A that converges in the weak-star sense to the measure ν, then P _K (ν _N )→P _K (ν) as \(N\to \infty \). The continuous Chebyshev (polarization) problem concerns maximizing P _K (μ) over all probability measures μ supported on A, while the N-point discrete Chebyshev problem maximizes P _K (μ) only over normalized counting measures for N-point multisets on A. We prove for such kernels and sets A, that if {ν _N } is a sequence of N-point measures solving the discrete problem, then every weak-star limit measure of ν _N as \(N \to \infty \) is a solution to the continuous problem.     

On DP-coloring of graphs and multigraphs

While solving a question on the list coloring of planar graphs, Dvo?ák and Postle introduced the new notion of DP-coloring (they called it correspondence coloring). A DP-coloring of a graph G reduces the problem of finding a coloring of G from a given list L to the problem of finding a “large” independent set in the auxiliary graph H(G,L) with vertex set {(v, c): v ∈ V (G) and c ∈ L(v)}. It is similar to the old reduction by Plesnevi? and Vizing of the k-coloring problem to the problem of finding an independent set of size |V(G)| in the Cartesian product G□K _k, but DP-coloring seems more promising and useful than the Plesnevi?–Vizing reduction. Some properties of the DP-chromatic number χ _DP (G) resemble the properties of the list chromatic number χ _l (G) but some differ quite a lot. It is always the case that χ _DP (G) ≥ χ _l (G). The goal of this note is to introduce DP-colorings for multigraphs and to prove for them an analog of the result of Borodin and Erd?s–Rubin–Taylor characterizing the multigraphs that do not admit DP-colorings from some DP-degree-lists. This characterization yields an analog of Gallai’s Theorem on the minimum number of edges in n-vertex graphs critical with respect to DP-coloring.     

Inverse problem with nonlocal observation of finding the coefficient multiplying <Emphasis Type="Italic">u</Emphasis> <Subscript> <Emphasis Type="Italic">t</Emphasis> </Subscript> in the parabolic equation

We study the inverse problem of the reconstruction of the coefficient ?(x, t) = ?⁰(x, t) + r(x) multiplying u_t in a nonstationary parabolic equation. Here ?⁰(x, t) ≥ ?⁰ > 0 is a given function, and r(x) ≥ 0 is an unknown function of the class L_∞(Ω). In addition to the initial and boundary conditions (the data of the direct problem), we pose the problem of nonlocal observation in the form ∫₀^Tu(x, t) dμ(t) = χ(x) with a known measure dμ(t) and a function χ(x). We separately consider the case dμ(t) = ω(t)dt of integral observation with a smooth function ω(t). We obtain sufficient conditions for the existence and uniqueness of the solution of the inverse problem, which have the form of ready-to-verify inequalities. We suggest an iterative procedure for finding the solution and prove its convergence. Examples of particular inverse problems for which the assumptions of our theorems hold are presented.     

Bessel Property of the System of Root Functions of a Second-Order Singular Operator on an Interval

For the system of root functions of an operator defined by the differential operation ?u″ + p(x)u′ + q(x)u, x ∈ G = (0, 1), with complex-valued singular coefficients, sufficient conditions for the Bessel property in the space L₂(G) are obtained and a theorem on the unconditional basis property is proved. It is assumed that the functions p(x) and q(x) locally belong to the spaces L₂ and W₂^?1, respectively, and may have singularities at the endpoints of G such that q(x) = q_R(x) +q′S(x) and the functions q_S(x), p(x), q ₂ ^S (x)w(x), p²(x)w(x), and q_R(x)w(x) are integrable on the whole interval G, where w(x) = x(1 ? x).     

Spectral asymptotics of a nonself-adjoint elliptic differential operator with an indefinite weight function

In the present paper, we compute the leading term of the asymptotics of the angular eigenvalue distribution function of the problem Au = λω(x)u(x) in a bounded domain Ω ? R ⁿ , where A is an elliptic differential operator of order 2m with domain D(A) ? W _m ^2m (Ω). The weight function ω(x) (x ∈ Ω) is indefinite and can also take zero values on a set of positive measure.     

Difference scheme for an initial–boundary value problem for a singularly perturbed transport equation

An initial–boundary value problem for a singularly perturbed transport equation with a perturbation parameter ε multiplying the spatial derivative is considered on the set ? = G ∪ S, where ? = D? × [0 ≤ t ≤ T], D? = {0 ≤ x ≤ d}, S = S ^l ∪ S, and S ^l and S₀ are the lateral and lower boundaries. The parameter ε takes arbitrary values from the half-open interval (0,1]. In contrast to the well-known problem for the regular transport equation, for small values of ε, this problem involves a boundary layer of width O(ε) appearing in the neighborhood of S ^l ; in the layer, the solution of the problem varies by a finite value. For this singularly perturbed problem, the solution of a standard difference scheme on a uniform grid does not converge ε-uniformly in the maximum norm. Convergence occurs only if h=dN^-1 ? ε and N₀^-1 ? 1, where N and N₀ are the numbers of grid intervals in x and t, respectively, and h is the mesh size in x. The solution of the considered problem is decomposed into the sum of regular and singular components. With the behavior of the singular component taken into account, a special difference scheme is constructed on a Shishkin mesh, i.e., on a mesh that is piecewise uniform in x and uniform in t. On such a grid, a monotone difference scheme for the initial–boundary value problem for the singularly perturbed transport equation converges ε-uniformly in the maximum norm at an ?(N^?1 + N₀^?1) rate.     

Tong-type identity and the mean square of the error term for an extended Selberg class

In 1956, Tong established an asymptotic formula for the mean square of the error term of the summatory function of the Piltz divisor function d3(n). The aim of this paper is to generalize Tong's method to a class of Dirichlet series L(s) which satisfies a functional equation. Let a(n) be an arithmetical function related to a Dirichlet series L(s), and let E(x) be the error term of ′n xa(n). In this paper, after introducing a class of Diriclet series with a general functional equation(which contains the well-known Selberg class), we establish a Tong-type identity and a Tong-type truncated formula for the error term of the Riesz mean of the coefficients of this Dirichlet series L(s). This kind of Tong-type truncated formula could be used to study the mean square of E(x) under a certain assumption. In other words, we reduce the mean square of E(x) to the problem of finding a suitable constant σ*which is related to the mean square estimate of L(s). We shall represent some results of functions in the Selberg class of degrees 2–4.     

On Homogenization for Non-Self-Adjoint Periodic Elliptic Operators on an Infinite Cylinder

We consider an operator A^ε on L₂(\({\mathbb{R}^{{d_1}}} \times {T^{{d_2}}}\)) (d₁ is positive, while d₂ can be zero) given by A^ε = ?div A(ε^?1x₁,x₂)?, where A is periodic in the first variable and smooth in a sense in the second. We present approximations for (A^ε ? μ)^?1 and ?(A^ε ? μ)^?1 (with appropriate μ) in the operator norm when ε is small. We also provide estimates for the rates of approximation that are sharp with respect to the order.     

On an Extremal Problem for Poset Dimension

Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) = n ^1/2. We improve the best known upper bound and show f(n) = O (n ^2/3). For higher dimensions, we show \(f_{d}(n)=\O \left (n^{\frac {d}{d + 1}}\right )\), where f _d (n) is the largest integer such that every poset on n elements has a d-dimensional subposet on f _d (n) elements.     

The Number of <Emphasis Type="Italic">k</Emphasis>-Sumsets in an Abelian Group

Let G be an abelian group of order n. The sum of subsets A₁,...,A_k of G is defined as the collection of all sums of k elements from A₁,...,A_k; i.e., A₁ + A₂ + · · · + A_k = {a₁ + · · · + a_k | a₁ ∈ A₁,..., a_k ∈ A_k}. A subset representable as the sum of k subsets of G is a k-sumset. We consider the problem of the number of k-sumsets in an abelian group G. It is obvious that each subset A in G is a k-sumset since A is representable as A = A₁ + · · · + A_k, where A₁ = A and A₂ = · · · = A_k = {0}. Thus, the number of k-sumsets is equal to the number of all subsets of G. But, if we introduce a constraint on the size of the summands A₁,...,A_k then the number of k-sumsets becomes substantially smaller. A lower and upper asymptotic bounds of the number of k-sumsets in abelian groups are obtained provided that there exists a summand A_i such that |A_i| = n log^qn and |A₁ +· · ·+ A_i-1 + A_i+1 + · · ·+A_k| = n log^qn, where q = -1/8 and i ∈ {1,..., k}.     

A mapping method in inverse Sturm-Liouville problems with singular potentials

In the space L ₂[0, π], the Sturm-Liouville operator L _D(y) = ?y″ + q(x)y with the Dirichlet boundary conditions y(0) = y(π) = 0 is analyzed. The potential q is assumed to be singular; namely, q = σ′, where σ ∈ L ₂[0, π], i.e., q ∈ W ₂ ^?1 [0, π]. The inverse problem of reconstructing the function σ from the spectrum of the operator L _D is solved in the subspace of odd real functions σ(π/2 ? x) = ?σ(π/2 + x). The existence and uniqueness of a solution to this inverse problem is proved. A method is proposed that allows one to solve this problem numerically.     

A new estimate for the vertex number of an edge-regular graph

Given a connected edge-regular graph Γ with parameters (v, k, λ) and b ₁ = k ? λ ? 1, we prove that in the case k ≥ 3b ₁ ?2 either |Γ₂(u)|(k?2b ₁ + 2) < kb ₁ for every vertex u or Γ is a polygon, the edge graph of a trivalent graph without triangles that has diameter greater than 2, the icosahedral graph, the complete multipartite graph K _r×2, the 3 × 3-grid, the triangular graph T(m) with m ≤ 7, the Clebsch graph, or the Schläfli graph.     

Parabolic equation with a singular potential

We study the existence of a nonnegative generalized solution of an initial-boundary value problem for the heat equation with a singular potential in an arbitrary bounded domain Ω ? R ⁿ , n ≥ 3, containing the unit ball. We show that if the condition ∝ _Ω V ^n/2+s |x| ^s dx ≤ c _n is satisfied for some s ≥ 0 and c _n = c _n (n, s, Ω) > 0, then the problem in question has a nonnegative solution.