On the spectrum of n quasigroups with given conjugate invariant subgroup

Let tⁿ be a vector of n positive integers that sum to 2n ? 1. Let u denote a vector of n or more positive integers that sum to n², and call u, n-universal if for every possible choice of t¹, t²,…, tⁿ, the components of the tⁱ can be arranged in the successive rows of an n-row matrix (with 0 in each unused cell) so that u is the vector of column sums.It is shown that (n,…, n)_{(n times)} is n-universal for every n. More generally, for odd n, any choice of t¹, t³,…, tⁿ can be placed in rows so that the column sums are (n, n?1,…, 2, 1); for even n, any choice of t², t⁴,…, tⁿ can be placed in rows so that the column sums are (n, n ?1,…, 2, 1). Hence, any u that can be obtained from the sum of two rows whose nonzero components are, respectively, n, n ?1,…, 2, 1 and n ?1, n ?2,…, 2, 1 (in any order, with 0's elsewhere) is n-universal.The problem examined is closely related to the graph conjecture that trees on 2, 3,…, n + 1 vertices can be superposed to yield the complete graph on n + 1 vertices.     

On the solvability of the jump problem in clifford analysis

Let Ω be a bounded open and oriented connected subset of ? ⁿ which has a compact topological boundary Γ, let C be the Dirac operator in ? ⁿ , and let ?_0,n be the Clifford algebra constructed over the quadratic space ? ⁿ . An ?_0,n -valued smooth function f : Ω → ?_0,n in Ω is called monogenic in Ω if Df = 0 in Ω. The aim of this paper is to present the most general condition on Γ obtained so far for which a Hölder continuous function f can be decomposed as F ⁺ ? F ^? = f on Γ, where the components F ^± are extendable to monogenic functions in Ω^± with Ω⁺ := Ω, and Ω^? := ? ⁿ \ (Ω ? Γ), respectively.     

Some congruences for the Apery numbers

In 1979 R. Apéry introduced the numbers a_n = Σ₀ⁿ(_kⁿ)²(_k^{n + k}) and u_n = Σ₀ⁿ(_kⁿ)²(_k^{n + k})² in his irrationality proof for ζ(2) and ζ(3). We prove some congruences for these numbers which generalize congruences previously published in this journal.     

Sharp upper bounds on the number of the scattering poles

We study the scattering poles of a compactly supported “black box” perturbations of the Laplacian in Rⁿ, n odd. We prove a sharp upper bound of the counting function N(r) modulo o(rⁿ) in terms of the counting function of the reference operator in the smallest ball around the black box. In the most interesting cases, we prove a bound of the type N(r)?A_nrⁿ+o(rⁿ) with an explicit A_n. We prove that this bound is sharp in a few special spherically symmetric cases where the bound turns into an asymptotic formula.     

On the complexity of calculating factorials

It is shown that n! can be evaluated with time complexity O(log log nM (n log n)), where M(n) is the complexity of multiplying two n-digit numbers together. This is effected, in part, by writing n! in terms of its prime factors. In conjunction with a fast multiplication this yields an O(n(log n log log n)²) complexity algorithm for n!. This might be compared to computing n! by multiplying 1 times 2 times 3, etc., which is ω(n² log n) and also to computing n! by binary splitting which is O(log nM(n log n)).     

Some soluble cases of the discrete logarithm problem

Letg be a primitive λ-root modn. Then the powersg ^t mod,n, fort=1, 2, ..., λ(n) represent a (cyclic) subgroupC _λ(n) (of order λ(n)) ofM _n , the group of order ?(n), representingall primitive residue classes modn. To computet backwards fromg ^t modn is calledthe discrete logarithm problem inC _λ(n), also expressible by $$a \equiv g^t \bmod n \Leftrightarrow t \equiv \log _g a\bmod \lambda \left( n \right).$$ The purpose of this paper is to point out some cases, in which this problem can be solved by astraight-forward formula only, with no element of guessing or collecting factorizations or the like involved at all, taking timeO(log³ n) or less to compute (orO(log^2+ε n), if fast multiplication of multiple precision integers is used).—One very simple case is given by the modulusn=10 ^s , fors≥4. To give just one instance of this case: Forn=10⁸, if the primitive λ-rootg=3¹⁷ ≡ 29140163 modn is chosen, anda=g ^t modn, then $$a \equiv 4962873 \cdot \frac{{a^{250000} - 1}}{{5000000}}\bmod 5000000.$$      

On the size of the Durfee square of a random integer partition

We prove a local limit theorem for the length of the side of the Durfee square in a random partition of a positive integer n as n→∞. We rely our asymptotic analysis on the power series expansion of x^m2∏_j=1^m(1−x^j)⁻² whose coefficient of xⁿ equals the number of partitions of n in which the Durfee square is m².     

The rank-width of the square grid

Rank-width is a graph width parameter introduced by Oum and Seymour. It is known that a class of graphs has bounded rank-width if, and only if, it has bounded clique-width, and that the rank-width of G is less than or equal to its branch-width.The n×nsquare grid, denoted by G_n,n, is a graph on the vertex set {1,2,…,n}×{1,2,…,n}, where a vertex (x,y) is connected by an edge to a vertex (x^′,y^′) if and only if |x−x^′|+|y−y^′|=1.We prove that the rank-width of G_n,n is equal to n−1, thus solving an open problem of Oum.     

Functional Chung laws for small increments of the empirical process and a lower bound in the strong invariance principle

Consider the set Θ _n of all a _n -sized increment processes of the uniform empirical process α _n on [0, 1]. We assume that a _n ↓ 0, na _n ↑ ∞, d _n = na _n (log _n)^?1 → ∞ and na _n (log n)^?7/3 = O(1). In Berthet (1996, 2005) the fourth assumption was shown to be critical with respect to the pointwise rates of convergence in the functional law of Deheuvels and Mason (1992) for Θ _n because strong approximation methods become ineffective at such a small scale a _n . We are now able to study directly these small empirical increments and compute the exact rate of clustering of Θ _n to any Strassen function having Lebesgue derivative of bounded variation by making use of a sharp small deviation estimate for a Poisson process of high intensity due to Shmileva (2003a). It turns out that the best rates are of order d _n ^1/4 (log n)^?1 and are faster than in the Brownian case whereas the slowest rates are of order d _n ^?1/2 and correspond to the apparently crude ones obtained in Berthet (2005) by means of Gaussian small ball probabilities. These different sharp properties of the empirical and Brownian paths imply an almost sure lower bound in the strong invariance principle and provide a new insight into the famous KMT approximation of α _n .     

A third-order optimum property of the maximum likelihood estimator

Let θ⁽ⁿ⁾ denote the maximum likelihood estimator of a vector parameter, based on an i.i.d. sample of size n. The class of estimators θ⁽ⁿ⁾ + n^?1q(θ⁽ⁿ⁾), with q running through a class of sufficiently smooth functions, is essentially complete in the following sense: For any estimator T⁽ⁿ⁾ there exists q such that the risk of θ⁽ⁿ⁾ + n^?1q(θ⁽ⁿ⁾) exceeds the risk of T⁽ⁿ⁾ by an amount of order o(n^?1) at most, simultaneously for all loss functions which are bounded, symmetric, and neg-unimodal. If $\text{q}{}^1$ is chosen such that $\text{θ}{}^{\mathrm{(n)}}\text{+ n}{}^{\mathrm{?1}}\text{q}{}^1\text{(θ}{}^{\mathrm{(n)}}\text{)}$ is unbiased up to $\text{o(n}{}^{\mathrm{<mtext>?1</mtext><mtext>2</mtext>}}\text{)}$, then this estimator minimizes the risk up to an amount of order o(n^?1) in the class of all estimators which are unbiased up to $\text{o(n}{}^{\mathrm{<mtext>?1</mtext><mtext>2</mtext>}}\text{)}$.The results are obtained under the assumption that T⁽ⁿ⁾ admits a stochastic expansion, and that either the distributions have—roughly speaking—densities with respect to the lebesgue measure, or the loss functions are sufficiently smooth.