The exact density function of the ratio of two dependent linear combinations of chi-square variables

A computable expression is derived for the raw moments of the random variableZ=N/D whereN= ₁ ⁿ m _iX_i+ _n ^+1s m _iX_i,D= _n ^+1s l _iX_i+ _s ^+1r n _iX_i, and theX _i's are independently distributed central chi-square variables. The first four moments are required for approximating the distribution ofZ by means of Pearson curves. The exact density function ofZ is obtained in terms of sums of generalized hypergeometric functions by taking the inverse Mellin transform of theh-th moment of the ratioN/D whereh is a complex number. The casen=1,s=2 andr=3 is discussed in detail and a general technique which applies to any ratio having the structure ofZ is also described. A theoretical example shows that the inverse Mellin transform technique yields the exact density function of a ratio whose density can be obtained by means of the transformation of variables technique. In the second example, the exact density function of a ratio of dependent quardratic forms is evaluated at various points and then compared with simulated values.     

Multiplicative infinite loop space theory

Let G be a finitely presented group given by its pre-abelian presentation <X1,…,Xm; Xe11ζ1,…,Xemmζ,ζm+1,…>, where ei≥0 for i = 1,…, m and ζj?G′ for j≥1. Let N be the subgroup of G generated by the normal subgroups [xeii, G] for i = 1,…, m. Then Dn+2(G)≡γn+2(G) (modNG′) for all n≥0, where G” is the second commutator subgroup of G,γn+2(G) is the (n+2)th term of the lower central series of G and Dn+2(G) = G∩(1+△n+2(G)) is the (n+2)th dimension subgroup of G.     

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.     

Recursive linear orders with recursive successivities

A successivity in a linear order is a pair of elements with no other elements between them. A recursive linear order with recursive successivities $\text{U}$ is recursively categorical if every recursive linear order with recursive successivities isomorphic to $\text{U}$ is in fact recursively isomorphic to $\text{U}$. We characterize those recursive linear orders with recursive successivities that are recursively categorical as precisely those with order type k₁+g₁+k₂+g₂+…+g_n-1+k_n where each k_n is a finite order type, non-empty for i?{2,…,n-1} and each g_i is an order type from among {ω,ω^*,ω+ω^*}∪{k·η:k<ω}.     

Stability and bifurcation in a harmonic oscillator with delays

We consider a harmonic oscillator with delays. Linear stability is investigated by analyzing the associated characteristic transcendental equation. The bifurcation analysis of the equation shows that Hopf bifurcation can occur as the delay τ (taken as a parameter) crosses some critical values. The direction and stability of the Hopf bifurcation are considered by using the normal form theory due to Faria and Magalhães. An example is given to explain the results. Numerical simulations support our results.     

An improvement of the five halves theorem of J. Boardman

Let (M ^m , T) be a smooth involution on a closed smooth m-dimensional manifold and F = ∪ _j=0 ⁿ F ^j (n ≤ m) its fixed point set, where F ^j denotes the union of those components of F having dimension j. The famous Five Halves Theorem of J. Boardman, announced in 1967, establishes that, if F is nonbounding, then m ≤ 5/2n. In this paper we obtain an improvement of the Five Halves Theorem when the top dimensional component of F, F ⁿ , is nonbounding. Specifically, let ω = (i ₁, i ₂, …, i _r ) be a non-dyadic partition of n and s _ω (x ₁, x ₂, …, x _n ) the smallest symmetric polynomial over Z ₂ on degree one variables x ₁, x ₂, …, x _n containing the monomial \(x_1^{i_1 } x_2^{i_2 } \cdots x_r^{i_r }\). Write s _ω (F ⁿ ) ∈ H ⁿ (F ⁿ , Z ₂) for the usual cohomology class corresponding to s _ω (x ₁, x ₂, …, x _n ), and denote by ?(F ⁿ ) the minimum length of a nondyadic partition ω with s _ω (F ⁿ ) ≠ 0 (here, the length of ω = (i ₁, i ₂, …, i _r ) is r). We will prove that, if (M ^m , T) is an involution for which the top dimensional component of the fixed point set, F ⁿ , is nonbounding, then m ≤ 2n + ?(F ⁿ ); roughly speaking, the bound for m depends on the degree of decomposability of the top dimensional component of the fixed point set. Further, we will give examples to show that this bound is best possible.     

Weighted rational approximation in the complex plane

Given a triple (G, W, γ) of an open bounded set G in the complex plane, a weight function W(z) which is analytic and different from zero in G, and a number γ with 0 ≤ γ ≤ 1, we consider the problem of locally uniform rational approximation of any function ƒ(z), which is analytic in G, by weighted rational functions W^m_i+n_i(z)R_mi, n_i(z)_{i = 0}^∞, where R_mi, n_i(z) = P_mi(z)/Q_ni(z) with deg P_mi ≤ m_i and deg Q_ni ≤ n_i for all i ≥ 0 and where m_i + n_i → ∞ as i → ∞ such that lim m_i/[m_i + n_i] = γ. Our main result is a necessary and sufficient condition for such an approximation to be valid. Applications of the result to various classical weights are also included.     

Construction of a Jacobi matrix from spectral data

A proof is given for the existence and uniqueness of a correspondence between two pairs of sequences {a},{b} and {ω},{μ}, satisfying b_i>0 for i=1,…,n?1 and ω₁<μ₁<?<μ_n?1<ω_n, under which the symmetric Jacobi matrices J(n,a,b) and J(n?1,a,b) have eigenvalues {ω} and {μ} respectively. Here J(m,a,b) is symmetric and tridiagonal with diagonal elements a_i (i=1,…,m) and off diagonal elements b_i (i=1,…,m?1). A new concise proof is given for the known uniqueness result. The existence result is new.     

A note on bideterminants for Schur superalgebras

Let S(m|n,r)_Z be a Z-form of a Schur superalgebra S(m|n,r) generated by elements ξ_i,j. We solve a problem of Muir and describe a Z-form of a simple S(m|n,r)-module D_λ,Q over the field Q of rational numbers, under the action of S(m|n,r)_Z. This Z-form is the Z-span of modified bideterminants [T_?:T_i] defined in this work. We also prove that each [T_?:T_i] is a Z-linear combination of modified bideterminants corresponding to (m|n)-semistandard tableaux T_i.     

On orthogonal matrices with constant diagonal

In connection with the problem of finding the best projections of k-dimensional spaces embedded in n-dimensional spaces Hermann König asked: Given m∈$\text{R}$ and n∈$\text{N}$, are there n×n matrices C=(c_ij), i, j=1,…,n, such that c_ii=m for all i, |c_ij|=1 for i≠j, and C²=(m²+n?1)I_n? König was especially interested in symmetric C, and we find some families of matrices satisfying this condition. We also find some families of matrices satisfying the less restrictive condition CC^T=(m²+n?1)I_n.     

Convolutions of random measures on compact groups

LetG be a compact group andM ₁(G) be the convolution semigroup of all Borel probability measures onG with the weak topology. We consider a stationary sequence {μ _n } _n=?∞ ^+∞ of random measures μ _n =μ _n (ω) inM ₁(G) and the convolutions $$v_{m,n} (\omega ) = \mu _m (\omega )* \cdots *\mu _{n - 1} (\omega ), m< n$$ and $$\alpha _n^{( + k)} (\omega ) = \frac{1}{k}\sum\limits_{i = 1}^k {v_{n,n + i} (\omega ),} \alpha _n^{( - k)} (\omega ) = \frac{1}{k}\sum\limits_{i = 1}^k {v_{n - i,n} (\omega )} $$ We describe the setsA _m ⁺ (ω) andA _n ⁺ (ω) of all limit points ofv _m,n(ω) asm→?∞ orn→+∞ and the setA _∞(ω) of its two-sided limit points for typical realizations of {μ _n (ω)} _n=?∞ ^+∞ . Using an appropriate random ergodic theorem we study the limit random measures ρ _n ^(±) (ω)=lim _k→∞ α _n ^(±k) (ω).     

Rose window graphs underlying rotary maps

Given natural numbers n≥3 and 1≤a,r≤n−1, the rose window graph R_n(a,r) is a quartic graph with vertex set {x_i∣i∈Z_n}∪{y_i∣i∈Z_n} and edge set {{x_i,x_i+1}∣i∈Z_n}∪{{y_i,y_i+r}∣i∈Z_n}∪{{x_i,y_i}∣i∈Z_n}∪{{x_i+a,y_i}∣i∈Z_n}. In this paper rotary maps on rose window graphs are considered. In particular, we answer the question posed in [S. Wilson, Rose window graphs, Ars Math. Contemp. 1 (2008), 7-19. http://amc.imfm.si/index.php/amc/issue/view/5] concerning which of these graphs underlie a rotary map.     

Smooth and non-smooth travelling waves in a nonlinearly dispersive Boussinesq equation

The dynamical behavior and special exact solutions of nonlinear dispersive Boussinesq equation (B(m,n) equation), u_tt−u_xx−a(uⁿ)_xx+b(u^m)_xxxx=0, is studied by using bifurcation theory of dynamical system. As a result, all possible phase portraits in the parametric space for the travelling wave system, solitary wave, kink and anti-kink wave solutions and uncountably infinite many smooth and non-smooth periodic wave solutions are obtained. It can be shown that the existence of singular straight line in the travelling wave system is the reason why smooth waves converge to cusp waves, finally. When parameter are varied, under different parametric conditions, various sufficient conditions guarantee the existence of the above solutions are given.     

On the representation of integers by p-adic diagonal forms

Let p be an odd prime, let d be a positive integer such that (d,p?1)=1, let r denote the p-adic valuation of d and let m=1+3+3²+…+3^r. It is shown that for every p-adic integer n the equation Σ_i=1^mX_i^d=n has a nontrivial p-adic solution. It is also shown that for all p-adic units a₁, a₂, a₃, a₄ and all p-adic integers n the equation Σ_i=1⁴a_iX_i^p=n has a nontrivial p-adic solution. A corollary to each of these results is that every p-adic integer is a sum of four pth powers of p-adic integers.     

On the existence of graphs of diameter two and defect two

In the context of the degree/diameter problem, the ‘defect’ of a graph represents the difference between the corresponding Moore bound and its order. Thus, a graph with maximum degree d and diameter two has defect two if its order is n=d²−1. Only four extremal graphs of this type, referred to as (d,2,2)-graphs, are known at present: two of degree d=3 and one of degree d=4 and 5, respectively. In this paper we prove, by using algebraic and spectral techniques, that for all values of the degree d within a certain range, (d,2,2)-graphs do not exist.The enumeration of (d,2,2)-graphs is equivalent to the search of binary symmetric matrices A fulfilling that AJ_n=dJ_n and A²+A+(1−d)I_n=J_n+B, where J_n denotes the all-one matrix and B is the adjacency matrix of a union of graph cycles. In order to get the factorization of the characteristic polynomial of A in Q[x], we consider the polynomials F_i,d(x)=f_i(x²+x+1−d), where f_i(x) denotes the minimal polynomial of the Gauss period , being ζ_i a primitive ith root of unity. We formulate a conjecture on the irreducibility of F_i,d(x) in Q[x] and we show that its proof would imply the nonexistence of (d,2,2)-graphs for any degree d>5.     

Valeurs aux entiers négatifs des séries de Dirichlet associées a un polynôme,I

In this paper, we are studying Dirichlet series Z(P,ξ,s) = Σ_n?$\text{N}$^1rP(n)^?s ξⁿ, where P ∈ $\text{R}$₊ [X₁,…,X_r] and ξⁿ = ξ₁ⁿ¹ … ξ_r^nr, with ξ_i ∈ $\text{C}$, such that |ξ_i| = 1 and ξ_i ≠ 1, 1 ≦ i ≦ r. We show that Z(P, ξ,·) can be continued holomorphically to the whole complex plane, and that the values Z(P, ξ, ?k) for all non negative integers, belong to the field generated over $\text{Q}$ by the ξ_i and the coefficients of P. If, there exists a number field K, containing the ξ_i, 1 ≦ i ≦ r, and the coefficients of P, then we study the denominators of Z(P, ξ, ?k) and we define a $\text{B}$-adic function Z$\text{B}$(P, ξ,·) which is equal, on class of negative integers, to Z(P, ξ, ?k).     

Partitions and sums of integers with repetition

A partition of N is called “admissible” provided some cell has arbitrarily long arithmetic progressions of even integers in a fixed increment. The principal result is that the statement “Whenever {A_i}_{i < r} is an admissible partition of N, there are some i < r and some sequence 〈x_n〉_{n < ω} of distinct members of N such that x_n + x_m?A_i whenever {m, n} ? ω″ is true when r = 2 and false when r ? 3.     

Endomorphisms of the shift dynamical system, discrete derivatives, and applications

All continuous endomorphisms f_∞ of the shift dynamical system S on the 2-adic integers Z₂ are induced by some , where n is a positive integer, B_n is the set of n-blocks over {0, 1}, and f_∞(x)=y₀y₁y₂… where for all i∈N, y_i=f(x_ix_i+1…x_i+n−1). Define D:Z₂→Z₂ to be the endomorphism of S induced by the map {(00,0),(01,1),(10,1),(11,0)} and V:Z₂→Z₂ by V(x)=−1−x. We prove that D, V°D, S, and V°S are conjugate to S and are the only continuous endomorphisms of S whose parity vector function is solenoidal. We investigate the properties of D as a dynamical system, and use D to construct a conjugacy from the 3x+1 function T:Z₂→Z₂ to a parity-neutral dynamical system. We also construct a conjugacy R from D to T. We apply these results to establish that, in order to prove the 3x+1 conjecture, it suffices to show that for any m∈Z⁺, there exists some n∈N such that R⁻¹(m) has binary representation of the form or .