Uniqueness implies existence and uniqueness conditions for nonlocal boundary value problems for nth order differential equations

For the nth order differential equation, y(n)=f(x,y,y^′,…,y(n−1)), we consider uniqueness implies existence results for solutions satisfying certain nonlocal (k+2)-point boundary conditions, 1?k?n−1. Uniqueness of solutions when k=n−1 is intimately related to uniqueness of solutions when 1?k?n−2. These relationships are investigated as well.     

Toward optimal gossiping schemes with conference calls

n people have distinct bits of information which they can communicate by k-person conference calls. The object of gossip is to inform everyone of everyone else's information. Which networks admit a minimum call gossip scheme? For k = 2 a necessary and sufficient condition for such a network is that it is connected and contains a cycle of length 4. We address the same question for k>2. The values of n are partitioned into 2 classes: trivial and nontrivial. A necessary and sufficient condition is given for networks of size n for trivial n. For nontrivial n a sufficient condition is given and its necessity is conjectured.     

A note on short cycles in a hypercube

How many edges can a quadrilateral-free subgraph of a hypercube have? This question was raised by Paul Erd?s about 27 years ago. His conjecture that such a subgraph asymptotically has at most half the edges of a hypercube is still unresolved. Let f(n,C_l) be the largest number of edges in a subgraph of a hypercube Q_n containing no cycle of length l. It is known that f(n,C_l)=o(|E(Q_n)|), when l=4k, k?2 and that . It is an open question to determine f(n,C_l) for l=4k+2, k?2. Here, we give a general upper bound for f(n,C_l) when l=4k+2 and provide a coloring of E(Q_n) by four colors containing no induced monochromatic C₁₀.     

On the exactness of certain inequalities in approximation theory

We prove the following: for every sequence {F_v}, F_v ? 0, F_v > 0 there exists a functionf such that

1. E_n(f)?F_n (n=0, 1, 2, ...) and
2. A_kn^?k? _v=1 ⁿ v^k?1 F_v?1?Ω_k (f, n^?1) (n=1, 2, ...).

     

On the number of combinations without unit separation

Let f(n, k) denote the number of ways of selecting k objects from n objects arrayed in a line with no two selected having unit separation (i.e., having exactly one object between them). Then, if $\text{n ? 2(k ? 1), f(n,k)=}\text{∑}\text{i=0}\text{κ}\text{(}\text{n?k+I?2i}\text{k?2i}\text{)}$ (where $\text{κ = [}\text{k}\text{2}\text{]}$). If n < 2(k ? 1), then f(n, k) = 0. In addition, f(n, k) satisfies the recurrence relation f(n, k) = f(n ? 1, k) + f(n ? 3, k ? 1) + f(n ? 4, k ? 2). If the objects are arrayed in a circle, and the corresponding number is denoted by g(n, k), then for n > 3, g(n, k) = f(n ? 2, k) + 2f(n ? 5, k ? 1) + 3f(n ? 6, k ? 2). In particular, if n ? 2k + 1 then $\text{(n,k)=(}\text{n?k}\text{k}\text{)+(}\text{n?k?1}\text{k?1}\text{)}$.     

A Galerkin Approximation for the Initial-Value Problem for Linear Second-Order Differential Equations

In this paper, a Galerkin type algorithm is given for the numerical solution of L(x)=(r(t)x'(t))'-p(t)x(t)=g(t); x(a)=x_a, x'(a)=x'_a, where r (t)>f0, and Spline hat functions form the approximating basis. Using the related quadratic form, a two-step difference equation is derived for the numerical solutions. A discrete Gronwall type lemma is then used to show that the error at the node points satisfies e_k=0(h²). If e(t) is the error function on a?t?b; it is also shown (in a variety of norms) that e(t)?Ch² and e'(t)?C₁h. Test case runs are also included. A (one step) Richardson or Rhomberg type procedure is used to show that e^R_k=0(h⁴). Thus our results are comparable to Runge-Kutta with half the function evaluations.     

Degenerate orbits of adjoint representation of orthogonal and unitary groups regarded as algebraic submanifolds

We suggest a method for describing some types of degenerate orbits of orthogonal and unitary groups in the corresponding Lie algebras as level surfaces of a special collection of polynomial functions. This method allows one to describe orbits of the types SO(2n)/SO(2k)×SO(2) ^n?k , SO(2n+1)/SO(2k+1)×SO(2) ^n?k , and (S)U(n)/(S)(U(2k)×U(2) ^n?k ) in so(2n), so(2n+1), and (s)u(n), respectively. In addition, we show that the orbits of minimal dimensions of the groups under consideration can be described in the corresponding algebras as intersections of quadries. In particular, this approach is used for describing the orbit CP ^n?1?u(n).     

Approximation by antiderivatives

Let Ω ?C be an open set with simply connected components and suppose that the functionφ is holomorphic on Ω. We prove the existence of a sequence {φ ^(?n)} ofn-fold antiderivatives (i.e., we haveφ ⁽⁰⁾(z)∶=φ(z) andφ ^(?n)(z)=dφ ^(?n?1)(z)/dz for alln ∈ N₀ and z ∈ Ω) such that the following properties hold:

1. For any compact setB ?Ω with connected complement and any functionf that is continuous onB and holomorphic in its interior, there exists a sequence {n _k} such that {φ^?nk} converges tof uniformly onB.
2. For any open setU ?Ω with simply connected components and any functionf that is holomorphic onU, there exists a sequence {m _k} such that {φ^?mk} converges tof compactly onU.
3. For any measurable setE ?Ω and any functionf that is measurable onE, there exists a sequence {p _k} such that {φ ^(-Pk)} converges tof almost everywhere onE.

     

On minimal Sturmian partial words

Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A_?=A∪{?}, where ? stands for a hole and matches (or is compatible with) every letter in A. The subword complexity of a partial word w, denoted by p_w(n), is the number of distinct full words (those without holes) over the alphabet that are compatible with factors of length n of w. A function f:N→N is (k,h)-feasible if for each integer N≥1, there exists a k-ary partial word w with h holes such that p_w(n)=f(n) for all n such that 1≤n≤N. We show that when dealing with feasibility in the context of finite binary partial words, the only affine functions that need investigation are f(n)=n+1 and f(n)=2n. It turns out that both are (2,h)-feasible for all non-negative integers h. We classify all minimal partial words with h holes of order N with respect to f(n)=n+1, called Sturmian, computing their lengths as well as their numbers, except when h=0 in which case we describe an algorithm that generates all minimal Sturmian full words. We show that up to reversal and complement, any minimal Sturmian partial word with one hole is of the form aⁱ?a^jba^l, where i,j,l are integers satisfying some restrictions, that all minimal Sturmian partial words with two holes are one-periodic, and that up to complement, ?(a^N−1?)^h−1 is the only minimal Sturmian partial word with h≥3 holes. Finally, we give upper bounds on the lengths of minimal partial words with respect to f(n)=2n, showing them tight for h=0,1 or 2.     

A singular boundary value problem for odd-order differential equations

The odd-order differential equation (−1)ⁿx⁽²ⁿ⁺¹⁾=f(t,x,…,x⁽²ⁿ⁾) together with the Lidstone boundary conditions x^(2j)(0)=x^(2j)(T)=0, 0?j?n−1, and the next condition x⁽²ⁿ⁾(0)=0 is discussed. Here f satisfying the local Carathéodory conditions can have singularities at the value zero of all its phase variables. Existence result for the above problem is proved by the general existence principle for singular boundary value problems.     

Entire functions that share a small function with its derivative

In this paper, by studying the properties of meromorphic functions which have few zeros and poles, we find all the entire functions f(z) which share a small and finite order meromorphic function a(z) with its derivative, and f(n)(z)−a(z)=0 whenever f(z)−a(z)=0 (n?2). This result is a generalization of several previous results.     

Best methods of interpolation for certain classes of differentiable functions

For the class W^(r)L_q (M;a, b), 1≤q≤∞, we construct the best method of approximation of the functionalf (x), x∈ [a, b], among all the methods using only information about the values off (^k)(x_i) (k=0, 1, ..., r?1; i=1, 2, ..., N).     

A note on the probabilistic approach to Turán's problem

The Turán number T(n, l, k) is the smallest possible number of edges in a k-graph on n vertices such that every l-set of vertices contains an edge. Given a k-graph H = (V(H), E(H)), we let X_s(S) equal the number of edges contained in S, for any s-set S?V(H). Turán's problem is equivalent to estimating the expectation E(X_l), given that min(X_l) ≥ 1. The following lower bound on the variance of X_s is proved:

$\text{Var(X}{}_{\mathrm{s}}\text{)?mm}\text{n?2k}\text{s?k}\text{n}\text{s}{}^{\mathrm{?1}}\text{n}\text{k}{}^1$

, where m = |E(H)| and $\text{m}\text{= (}{}_{\mathrm{k}}{}^{\mathrm{n}}\text{) ? m}$. This implies the following: putting t(k, l) = lim_n→∞T(n, l, k)(_kⁿ)^?1 then t(k, l) ≥ T(s, l, k)((_k^s) ? 1)^?1, whenever s ≥ l > k ≥ 2. A connection of these results with the existence of certain t-designs is mentioned.     

On stronger conjectures that imply the Erd?s-Moser conjecture

The Erd?s-Moser conjecture states that the Diophantine equation Sk(m)=mk, where Sk(m)=k¹+k²+?+k(m−1), has no solution for positive integers k and m with k?2. We show that stronger conjectures about consecutive values of the function Sk, that seem to be more naturally, imply the Erd?s-Moser conjecture.     

Centerpole sets for colorings of abelian groups

A subset C?G of a group G is called k-centerpole if for each k-coloring of G there is an infinite monochromatic subset G, which is symmetric with respect to a point c??C in the sense that S=cS ^?1 c. By c _k (G) we denote the smallest cardinality c _k (G) of a k-centerpole subset in G. We prove that c _k (G)=c _k (? ^m ) if G is an abelian group of free rank m??k. Also we prove that c ₁(? ⁿ⁺¹)=1, c ₂(? ⁿ⁺²)=3, c ₃(? ⁿ⁺³)=6, 8??c ₄(? ⁿ⁺⁴)??c ₄(?⁴)=12 for all n????, and ${\frac{1}{2}(k^{2}+3k-4)\le c_{k}(\mathbb{Z}^{n})\le2^{k}-1-\max_{s\le k-2}\binom {k-1}{s-1}}$ for all n??k??4.     

A combinatorial problem involving graphs and matrices

In this paper we discuss a combinatorial problem involving graphs and matrices. Our problem is a matrix analogue of the classical problem of finding a system of distinct representatives (transversal) of a family of sets and relates closely to an extremal problem involving 1-factors and a long standing conjecture in the dimension theory of partially ordered sets. For an integer n ?1, let n denote the n element set {1,2,3,…, n}. Then let A be a k×t matrix. We say that A satisfies property P(n, k) when the following condition is satisfied: For every k-taple (x₁,x₂,…,x_k?n^k there exist k distinct integers j₁,j₂,…,j_k so that x_i= a_ii for i= 1,2,…,k. The minimum value of t for which there exists a k × t matrix A satisfying property P(n,k) is denoted by f(n,k). For each k?1 and n sufficiently large, we give an explicit formula for f(n, k): for each n?1 and k sufficiently large, we use probabilistic methods to provide inequalities for f(n,k).     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

Three-variable Mahler measures and special values of modular and Dirichlet L-series

In this paper we prove that the Mahler measures of the Laurent polynomials (x+x ^?1)(y+y ^?1)(z+z ^?1)+k ^1/2, (x+x ^?1)²(y+y ^?1)²(1+z)³ z ^?2?k, and x ⁴+y ⁴+z ⁴+1+k ^1/4 xyz, for various values of k, are of the form r ₁ L′(f,0)+r ₂ L′(χ,?1), where $r_{1},r_{2}\in \mathbb{Q}$ , f is a CM newform of weight 3, and χ is a quadratic character. Since it has been proved that these Mahler measures can also be expressed in terms of logarithms and ₅ F ₄-hypergeometric series, we obtain several new hypergeometric evaluations and transformations from these results.     

Stability of Cubic and Quartic Functional Equations in Non-Archimedean Spaces

We prove generalized Hyers-Ulam–Rassias stability of the cubic functional equation f(kx+y)+f(kx?y)=k[f(x+y)+f(x?y)]+2(k ³?k)f(x) for all \(k\in \Bbb{N}\) and the quartic functional equation f(kx+y)+f(kx?y)=k ²[f(x+y)+f(x?y)]+2k ²(k ²?1)f(x)?2(k ²?1)f(y) for all \(k\in \Bbb{N}\) in non-Archimedean normed spaces.     

Eigenfunctions of expected value operators in the Wishart distribution,II

Let V = (v_ij) denote the k × k symmetric scatter matrix following the Wishart distribution W(k, n, Σ). The problem posed is to characterize the eigenfunctions of the expectation operators of the Wishart distribution, i.e., those scalar-valued functions f(V) such that (E_nf)(V) = λ_n,kf(V). A finite sequence of polynomial eigenspaces, EP spaces, exists whose direct sum is the space of all homogeneous polynomials. These EP subspaces are invariant and irreducible under the action of the congruence transformation V → T′VT. Each of these EP subspaces contains an orthogonally invariant subspace of dimension one. The number of EP subspaces is determined and eigenvalues are computed. Bi-linear expansions of $\text{|I + VA|}{}^{\mathrm{<mtext>?n</mtext><mtext>2</mtext>}}$ and (tr VA)^r into eigenfunctions are given. When f(V) is an EP polynomial, then f(V^?1) is an EP function. These EP subspaces are identical to the more abstractly defined polynomial subspaces studied by James.