Maximum principle and propagation for intrinsicly regular solutions of differential inequalities structured on vector fields

We prove suitable versions of the weak maximum principle and of the maximum propagation for solutions u of a differential inequality Hu?0. Here H=_∑i,jai,j(z)ZiZj+Z₀ is a differential operator structured on the vector fields Zj's, whereas u belongs to an appropriate intrinsic class of regularity modelled on the Zj's.     

Extensions of band matrices with band inverses

Let R_ij be a given set of μ_i× μ_j matrices for i, j=1,…, n and |i?j| ?m, where 0?m?n?1. Necessary and sufficient conditions are established for the existence and uniqueness of an invertible block matrix =[F_ij], i,j=1,…, n, such that F_ij=R_ij for |i?j|?m, F admits either a left or right block triangular factorization, and (F^?1)_ij=0 for |i?j|>m. The well-known conditions for an invertible block matrix to admit a block triangular factorization emerge for the particular choice m=n?1. The special case in which the given R_ij are positive definite (in an appropriate sense) is explored in detail, and an inequality which corresponds to Burg's maximal entropy inequality in the theory of covariance extension is deduced. The block Toeplitz case is also studied.     

On a characterization of the exponential distribution by properties of order statistics

A continuous c.d.f. F(x), strictly increasing for x > 0, is exponential if and only if X_{j, n} - X_{i, n} and X_{j−i, n−i} have identical distribution for some i, n, j = j₁, j₂, 1 ⩽ i < j₁ <j₂ ⩽ n, n ⩾ 3. A new proof of this characterization is given, since in Ahsanullah (1975) where it was stated first, an implicit assumption in the proof is that F is NBU or NWU.     

On ARX(∞) approximation

Given data, u_j,y_j,j=1,…,n, with u_j an input sequence to a system while output is y_j, an approximation to the structure of the system generating y_j is to be obtained by regressing y_j on u_j−i,y_j−ii=1,…,p_n, where p_n increases with n. In this paper the rate of convergence of the coefficient matrices to their asymptotic values is discussed. The context is kept general so that, in particular, u_j is allowed to depend on y_i, i≤j, and no assumption of stationarity for the y_j or u_j sequences is made.     

Nash-solvable two-person symmetric cycle game forms

A two-person positional game form g (with perfect information and without moves of chance) is modeled by a finite directed graph (digraph) whose vertices and arcs are interpreted as positions and moves, respectively. All simple directed cycles of this digraph together with its terminal positions form the set A of the outcomes. Each non-terminal position j is controlled by one of two players i∈I={1,2}. A strategy x_i of a player i∈I involves selecting a move (j,j^′) in each position j controlled by i. We restrict both players to their pure positional strategies; in other words, a move (j,j^′) in a position j is deterministic (not random) and it can depend only on j (not on preceding positions or moves or on their numbers). For every pair of strategies (x₁,x₂), the selected moves uniquely define a play, that is, a directed path form a given initial position j₀ to an outcome (a directed cycle or terminal vertex). This outcome a∈A is the result of the game corresponding to the chosen strategies, a=a(x₁,x₂). Furthermore, each player i∈I={1,2} has a real-valued utility function u_i over A. Standardly, a game form g is called Nash-solvable if for every u=(u₁,u₂) the obtained game (g,u) has a Nash equilibrium (in pure positional strategies).A digraph (and the corresponding game form) is called symmetric if (j,j^′) is its arc whenever (j^′,j) is. In this paper we obtain necessary and sufficient conditions for Nash-solvability of symmetric cycle two-person game forms and show that these conditions can be verified in linear time in the size of the digraph.     

Discrete Toda lattices and the Laplace method

We apply the Laplace cascade method to systems of discrete equations of the form u _i+1,j+1 = f(u _i+1,j , u _i,j+1, u _i,j , u _i,j?1), where u _ij , i, j ∈ ?, is an element of a sequence of unknown vectors. We introduce the concept of a generalized Laplace invariant and the related property that the systems is “of the Liouville type.” We prove a series of statements about the correctness of the definition of the generalized invariant and its applicability for seeking solutions and integrals of the system. We give some examples of systems of the Liouville type.     

A Fractional Muckenhoupt–Wheeden Theorem and its Consequences

In the 1970s Muckenhoupt and Wheeden made several conjectures relating two weight norm inequalities for the Hardy-Littlewood maximal operator to such inequalities for singular integrals. Using techniques developed for the recent proof of the A ₂ conjecture we prove a related pair of conjectures linking the Riesz potential and the fractional maximal operator. As a consequence we are able to prove a number of sharp one and two weight norm inequalities for the Riesz potential.     

Netlike partial cubes III. The median cycle property

A graph G has the Median Cycle Property (MCP) if every triple (u₀,u₁,u₂) of vertices of G admits a unique median or a unique median cycle, that is a gated cycle C of G such that for all i,j,k∈{0,1,2}, if x_i is the gate of u_i in C, then: {x_i,x_j}⊆I_G(u_i,u_j) if i≠j, and d_G(x_i,x_j)<d_G(x_i,x_k)+d_G(x_k,x_j). We prove that a netlike partial cube has the MCP if and only if it contains no triple of convex cycles pairwise having an edge in common and intersecting in a single vertex. Moreover a finite netlike partial cube G has the MCP if and only if G can be obtained from a set of even cycles and hypercubes by successive gated amalgamations, and equivalently, if and only if G can be obtained from K₁ by a sequence of special expansions. We also show that the geodesic interval space of a netlike partial cube having the MCP is a Pash-Peano space (i.e. a closed join space).     

Bound on integrals: Elimination of the dual and reduction of the number of equality constraints

Let L_j (j = 1, …, n + 1) be real linear functions on the convex set $\text{F}$ of probability distributions. We consider the problem of maximization of L_n+1(F) under the constraint F ? $\text{F}$ and the equality constraints L₁(F) = z₁ (i = 1, …, n). Incorporating some of the equality constraints into the basic set $\text{F}$, the problem is equivalent to a problem with less equality constraints. We also show how the dual problems can be eliminated from the statement of the main theorems and we give a new illuminating proof of the existence of particular solutions.The linearity of the functions L_j(j = 1, …, n + 1) can be dropped in several results.     

Twisted inner products and contraction inequalities on spaces of contravariant and covariant tensors

Given positive integers n and p, and a complex finite dimensional vector space V, we let S_n,p(V) denote the set of all functions from V×V×?×V-(n+p copies) to C that are linear and symmetric in the first n positions, and conjugate linear symmetric in the last p positions. Letting κ=min{n,p} we introduce twisted inner products, [·,·]_s,t,1?s,t?κ, on S_n,p(V), and prove the monotonicity condition [F,F]_s,t?[F,F]_u,v is satisfied when s?u?κ,t?v?κ, and F∈S_n,p(V). Using the monotonicity condition, and the Cauchy-Schwartz inequality, we obtain as corollaries many known inequalities involving norms of symmetric multilinear functions, which in turn imply known inequalities involving permanents of positive semidefinite Hermitian matrices. New tensor and permanental inequalities are also presented. Applications to partial differential equations are indicated.     

Riesz transforms and conjugacy for Laguerre function expansions of Hermite type

Riesz transforms and conjugate Poisson integrals for multi-dimensional Laguerre function expansions of Hermite type with index α are defined and investigated. It is proved that for any multi-index α=(α₁,…,αd) such that αi?−1/2, αi∉(−1/2,1/2), the appropriately defined Riesz transforms , j=1,2,…,d, are Calderón-Zygmund operators, hence their mapping properties follow from a general theory. Similar mapping results are obtained in one dimension, without excluding α∈(−1/2,1/2), by means of a local Calderón-Zygmund theory and weighted Hardy's inequalities. The conjugate Poisson integrals are shown to satisfy a system of Cauchy-Riemann type equations and to recover the Riesz-Laguerre transforms on the boundary. The two specific values of α, (−1/2,…,−1/2) and (1/2,…,1/2), are distinguished since then a connection with Riesz transforms for multi-dimensional Hermite function expansions is established.     

Greedy F-colorings of graphs

Let G=(V,E) be a connected graph. For a symmetric, integer-valued function δ on V×V, where K is an integer constant, N₀ is the set of nonnegative integers, and Z is the set of integers, we define a C-mapping by F(u,v,m)=δ(u,v)+m−K. A coloring c of G is an F-coloring if F(u,v,|c(u)−c(v)|)?0 for every two distinct vertices u and v of G. The maximum color assigned by c to a vertex of G is the value of c, and the F-chromatic number F(G) is the minimum value among all F-colorings of G. For an ordering of the vertices of G, a greedy F-coloring c of s is defined by (1) c(v₁)=1 and (2) for each i with 1?i<n, c(v_i+1) is the smallest positive integer p such that F(v_j,v_i+1,|c(v_j)−p|)?0, for each j with 1?j?i. The greedy F-chromatic number gF(s) of s is the maximum color assigned by c to a vertex of G. The greedy F-chromatic number of G is gF(G)=min{gF(s)} over all orderings s of V. The Grundy F-chromatic number is GF(G)=max{gF(s)} over all orderings s of V. It is shown that gF(G)=F(G) for every graph G and every F-coloring defined on G. The parameters gF(G) and GF(G) are studied and compared for a special case of the C-mapping F on a connected graph G, where δ(u,v) is the distance between u and v and .     

An effective iterative method for computing real and complex roots of systems of nonlinear equations

A simple and flexible iterative method is proposed to determine the real or complex roots of any system of nonlinear equations F(x)=0. The idea is based on passing defined functions G_j(x_j),j=1,…,n tangent to F_i(x_j),i,j=1,…,n at an arbitrary starting point. Choosing G_j(x_j) in the form of or or any other reversible function compatible to F_i(x_j), where k is obtained for the best correlation with the function F_i(x_j), gives an added freedom, which in contrast with all existing methods, accelerates the convergence.The method that was first proposed for computing the roots of any single function is now adopted for a system of nonlinear equations. This method is compared to some classical and famous methods such as Newton’s method and Newton-Simpson’s method. The results show the effectiveness and robustness of this new method.     

Monotonicity of quotients of theta functions related to an extremal problem on harmonic measure

We prove that for fixed u and v such that u,v∈[0,1/2), the quotients θj(u|iπt)/θj(v|iπt), j=1,2,3,4, of the theta functions are monotone on 0<t<∞. The case v=0 has been used by the second author to study a generalization of Gonchar's problem on harmonic measure of radial slits.     

A generalization of the Gagliardo inequality

Consider functions u₁, u₂,..., u_n ∈ D(ℝ^k) and assume that we are given a certain set of linear combinations of the form ∑_{i, j} a _ij ^(l) ∂_ju_i. Sufficient conditions in terms of coefficients a _ij ^(l) are indicated under which the norms are controlled in terms of the L¹-norms of these linear combinations. These conditions are mostly transparent if k = 2. The classical Gagliardo inequality corresponds to a single function u₁ = u and the collection of its partial derivatives ∂₁u,..., ∂_ku. Bibliography: 2 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 345, 2007, pp. 120–139.     

Singular perturbation problems for systems of partial differential equations of elliptic type

Elliptic boundary value problems for systems of nonlinear partial differential equations of the form $\text{F}{}_{\mathrm{i}}\text{(x, u}{}_1\text{, u}{}_2\text{,…, u}{}_{\mathrm{N}}\text{,}\text{?u}{}_{\mathrm{i}}\text{?x}{}_{\mathrm{j}}\text{, ?}{}^{\mathrm{p}}{}_{\mathrm{i}}\text{?}{}^2\text{u}{}_{\mathrm{i}}\text{?x}{}_{\mathrm{j}}\text{?x}{}_{\mathrm{k}}\text{) = ?}{}_{\mathrm{i}}\text{(x), x ? R}{}^{\mathrm{n}}$, i = 1(1)N, j, k = 1(1)n, p_i ? 0, ? being a small parameter, with Dirichlet boundary conditions are considered. It is supposed that a formal approximation Z is given which satisfies the boundary conditions and the differential equations upto the order χ(?) = o(1) in some norm. Then, using the theory of differential inequalities, it is shown that under certain conditions the difference between the exact solution u of the boundary value problem and the formal approximation Z, taken in the sense of a suitable norm, can be made small.     

Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems

In this paper we present a minimal set of conditions sufficient to assure the existence of a solution to a system of nonnegative linear diophantine equations. More specifically, suppose we are given a finite item set U = {u₁, u₂, . . . , u_k} together with a "size" v_i ≡ v(u_i) ∈ Z⁺, such that v_i ≠ v_j for i ≠ j, a "frequency" a_i ≡ a(u_i) ∈ Z⁺, and a positive integer (shelf length) L ∈ Z⁺ with the following conditions: (i) L = ∏ⁿ_j=1p_j(p_j ∈ Z⁺ ∀j, p_j ≠ p_l for j ≠ l) and v_i = ∏ _j∈Aip_j, A_i ⊆ {l, 2, . . . , n} for i = 1, . . . , n; (ii) (A_i\{⋂^k_j=1A_j}) ∩ (A_l\{⋂^k_j=1A_j}) = ⊘∀i ≠ l. Note that v_i|L (divides L) for each i. If for a given m ∈ Z⁺, ∑ⁿ_i=1a_iv_i = mL (i.e., the total size of all the items equals the total length of the shelf space), we prove that conditions (i) and (ii) are sufficient conditions for the existence of a set of integers {b₁₁, b₁₂, . . . , b_1m, b₂₁, . . . , b_n1, . . . , b_nm}⊆ N such that ∑^m_j=1b_ij = a_i, i = 1, . . . , k, and ∑^k_i=1b_ijv_i = L, j =1, . . . , m (i.e., m shelves of length L can be fully utilized). We indicate a number of special cases of well known NP-complete problems which are subsequently decided in polynomial time.     

Job shop scheduling with unit time operations under resource constraints and release dates

We consider the problem of job shop scheduling with m machines and n jobs J_i, each consisting of l_i unit time operations. There are s distinct resources R_h and a quantity q_h available of each one. The execution of the j-th operation of J_i requires the presence of u_ijh units of R_h, 1 ≤i≤n, 1 ≤j≤l_i, and 1 ≤h≤s. In addition, each J_i has a release date r_i, that is J_i cannot start before time r_i. We describe algorithms for finding schedules having minimum length or sum of completion times of the jobs. Let l=max{l_i} and u=|{u_ijh}|. If m, u and l are fixed, then both algorithms terminate within polynomial time.     

A unique decomposition result for HT factors with torsion free core

We prove that II₁ factors M have a unique (up to unitary conjugacy) cross-product type decomposition around “core subfactors” N⊂M satisfying the property HT of [S. Popa, On a class of type II₁ factors with Betti numbers invariants, Ann. of Math. (2) 163 (2006) 809-899] and a certain “torsion freeness” condition. In particular, this shows that isomorphism of factors of the form Lαi(Z²)?Fni, i=1,2, for Fni⊂SL(2,Z) free groups of rank ni and αj=e2πitj, tj∉Q, implies n₁=n₂.