A particle method for some parabolic equations

We present a quasi-Monte-Carlo particle simulation of some multidimensional linear parabolic equations with constant coefficients. We approximate the elliptic operator in space by a finite-difference operator. We discretize time into intervals of length Δt. The discrete representation of the solution at time t_n = nΔt is a sum of Dirac delta measures. Using the explicit Euler scheme, the resulting approximation at time t_n+1 is recovered by a quasi-Monte-Carlo integration. We make use of a technique involving renumbering the simulated particles in every time step. We state and prove a convergence theorem for the method. Experimental results are presented for some model problems. The results suggest that the quasi-Monte-Carlo simulation tends to give more accurate solutions than a Monte-Carlo simulation, when the correct renumbering technique is used. Other choices can result in significant loss of efficiency.     

On the existence of Hadamard matrices

Given any natural number q > 3 we show there exists an integer t ? [2log₂(q ? 3)] such that an Hadamard matrix exists for every order 2^sq where s > t. The Hadamard conjecture is that s = 2.This means that for each q there is a finite number of orders 2^υq for which an Hadamard matrix is not known. This is the first time such a statement could be made for arbitrary q.In particular it is already known that an Hadamard matrix exists for each 2^sq where if q = 2^m ? 1 then s ? m, if q = 2^m + 3 (a prime power) then s ? m, if q = 2^m + 1 (a prime power) then s ? m + 1.It is also shown that all orthogonal designs of types (a, b, m ? a ? b) and (a, b), 0 ? a + b ? m, exist in orders m = 2^t and 2^t+2 · 3, t ? 1 a positive integer.     

A contribution to the Zarankiewicz problem

Given positive integers let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m×n that does not contain an all ones submatrix of size s×t. We show that if s?2 and t?2, then for every k=0,…,s-2,

z(m,n,s,t)?(s-k-1)^1/tnm^1-1/t+kn+(t-1)m^1+k/t.     

On the Fourier transforms of retarded Lorentz-invariant functions

In this article we evaluate the Fourier transforms of retarded Lorentz-invariant functions (and distributions) as limits of Laplace transforms. Our method works generally for any retarded Lorentz-invariant functions φ(t) (t?Rⁿ) which is, besides, a continuous function of slow growth. We give, among others, the Fourier transform of G_R(t, α, m², n) and G_A(t, α, m², n), which, in the particular case α = 1, are the characteristic functions of the volume bounded by the forward and the backward sheets of the hyperboloid u = m² and by putting α = ?k are the derivatives of k-order of the retarded and the advanced-delta on the hyperboloid u = m². We also obtain the Fourier transform of the function W(t, α, m², n) introduced by M. Riesz (Comm. Sem. Mat. Univ. Lund4 (1939)). We finish by evaluating the Fourier transforms of the distributional functions G_R(t, α, m², n), G_A(t, α, m², n) and W(t, α, m², n) in their singular points.     

The spectrum of additive BIB designs

In this article, the existence of additive BIB designs is discussed with direct and recursive constructions, together with investigation of a property of resolvability. Such designs can be used to construct infinite families of BIB designs. In particular, we obtain a series of B(sⁿ, ts^m, λt (ts^m ? 1) (s^n‐m ? 1)/[2(s^m ? 1)]) for any positive integer λ, such that sⁿ (sⁿ ? 1) λ ≡ 0 (mod s^m (s^m ? 1) and for any positive integer t with 2 ≤ t ≤ s^n‐m, where s is an odd prime power. Connections between additive BIB designs and other combinatorial objects such as multiply nested designs and perpendicular arrays are discussed. A construction of resolvable BIB designs with v = 4k is also proposed. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 235–254, 2007     

Combinatorial methods in the construction of point sets with uniformity properties

It is well known that (t, m, s)-nets are useful in numerical analysis. Many of the constructions of such nets arise from number theoretic or algebraic constructions. Less well known is the fact that combinatorial constructions also yield nets with very good and in many cases, optimal parameters. In this paper, we provide a survey of such combinatorial constructions of (t, m, s)-nets.     

Construction of Williamson type matrices

Recent advances in the construction of Hadamard matrices have depeaded on the existence of Baumert-Hall arrays and four (1, ?1) matrices A B C Dof order m which are of Williamson type, that is they pair-wise satisfy

i) MN^T = NM^T , ∈ {A B C D} and

ii) AA^T + BB^T + CC^T + DD^T = 4mI_m .

It is shown that Williamson type matrices exist for the orders m = s(4 ? 1)m = s(4s + 3) for s∈ {1, 3, 5, …, 25} and also for m = 93. This gives Williamson matrices for several new orders including 33, 95,189.

These results mean there are Hadamard matrices of order

i) 4s(4s ?1)t, 20s(4s ? 1)t,s ∈ {1, 3, 5, …, 25};

ii) 4s(4:s + 3)t, 20s(4s + 3)t s ∈ {1, 3, 5, …, 25};

iii) 4.93t, 20.93t

for

t ∈ {1, 3, 5, … , 61} ∪ {1 + 2 ^a 10 ^b 26 ^c a b c nonnegative integers}, which are new infinite families.

Also, it is shown by considering eight-Williamson-type matrices, that there exist Hadamard matrices of order 4(p + 1)(2p + l)r and 4(p + l)(2p + 5)r when p ≡ 1 (mod 4) is a prime power, 8ris the order of a Plotkin array, and, in the second case 2p + 6 is the order of a symmetric Hadamard matrix. These classes are new.     

Pancyclic graphs and linear forests

Given integers k,s,t with 0≤s≤t and k≥0, a (k,t,s)-linear forest F is a graph that is the vertex disjoint union of t paths with a total of k edges and with s of the paths being single vertices. If the number of single vertex paths is not critical, the forest F will simply be called a (k,t)-linear forest. A graph G of order n≥k+t is (k,t)-hamiltonian if for any (k,t)-linear forest F there is a hamiltonian cycle containing F. More generally, given integers m and n with k+t≤m≤n, a graph G of order n is (k,t,s,m)-pancyclic if for any (k,t,s)-linear forest F and for each integer r with m≤r≤n, there is a cycle of length r containing the linear forest F. Minimum degree conditions and minimum sum of degree conditions of nonadjacent vertices that imply that a graph is (k,t,s,m)-pancyclic (or just (k,t,m)-pancyclic) are proved.     

Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums

Let s=(s₁,…,s_m) and t=(t₁,…,t_n) be vectors of non-negative integer-valued functions with equal sum . Let N(s,t) be the number of m×n matrices with entries from {0,1} such that the ith row has row sum s_i and the jth column has column sum t_j. Equivalently, N(s,t) is the number of labelled bipartite graphs with degrees of the vertices in one side of the bipartition given by s and the degrees of the vertices in the other side given by t. We give an asymptotic formula for N(s,t) which holds when S→∞ with 1?st=o(S^2/3), where and . This extends a result of McKay and Wang [Linear Algebra Appl. 373 (2003) 273-288] for the semiregular case (when s_i=s for 1?i?m and t_j=t for 1?j?n). The previously strongest result for the non-semiregular case required 1?max{s,t}=o(S^1/4), due to McKay [Enumeration and Design, Academic Press, Canada, 1984, pp. 225-238].     

An algorithm for Gauss-Romberg integration

WhenR ^(m) f is anm copy version of a quadrature ruleRf, the error functional satisfies an asymptotic expansion $$R^{(m)} f - If \simeq d_2 h^2 + d_4 h^4 + ...,m = 1/h.$$ In the conventional form of Romberg Integration,Rf is the trapezoidal rule and early terms of this expansion are “eliminated.” For this purpose the Neville-Romberg algorithm is used to construct the conventionalT-table. IfRf is taken to be a ruleGf of polynomial degree 2t+1 the firstt terms in this expansion are in any case zero. A generalization of the Neville-Romberg algorithm is derived. This “eliminates” termsd _2s h ^2s ,s=t+1,t+2, ... An associatedG-table is defined and some of its properties are noted.     

Metrics and undirected cuts

Suppose thatG is an undirected graph whose edges have nonnegative integer-valued lengthsl(e), and that {s ₁,t ₁},?, {s _m ,t _m } are pairs of its vertices. Can one assign nonnegative weights to the cuts ofG such that, for each edgee, the total weight of cuts containinge does not exceedl(e) and, for eachi, the total weight of cuts ‘separating’s _i andt _i is equal to the distance (with respect tol) betweens _i andt _i ? Using linear programming duality, it follows from Papernov's multicommodity flow theorem that the answer is affirmative if the graph induced by the pairs {s ₁,t ₁},?, {s _m ,t _m } is one of the following: (i) the complete graph with four vertices, (ii) the circuit with five vertices, (iii) a union of two stars. We prove that if, in addition, each circuit inG has an even length (with respect tol) then there exists a suitable weighting of the cuts with the weights integer-valued; moreover, an algorithm of complexity O(n ³) (n is the number of vertices ofG) is developed for solving such a problem. Also a class of metrics decomposable into a nonnegative linear combination of cut-metrics is described, and it is shown that the separation problem for cut cones isNP-hard.     

Lower bounds on mt(r, s)

Useful lower bounds are obtained for m_t(r, s), s a prime power, r ? t ? 3, by relating (t ? 1)-flats of PG(r ? 1, s) to (t ? 1) and lower dimensional flats of its subgeometries. Explicit expressions in general are obtained for these bounds when t = 3. A general method is developed for deriving these bounds when t > 3.     

About a construction and some analysis of time inhomogeneous diffusions on monotonely moving domains

We construct and analyze in a very general way time inhomogeneous (possibly also degenerate or reflected) diffusions in monotonely moving domains E⊂R×R^d, i.e. if E_t?{x∈R^d|(t,x)∈E}, t∈R, then either E_s⊂E_t, ∀s?t, or E_s⊃E_t, ∀s?t, s,t∈R. Our major tool is a further developed L²(E,m)-analysis with well chosen reference measure m. Among few examples of completely different kinds, such as e.g. singular diffusions with reflection on moving Lipschitz domains in R^d, non-conservative and exponential time scale diffusions, degenerate time inhomogeneous diffusions, we present an application to what we name skew Bessel process on γ. Here γ is either a monotonic function or a continuous Sobolev function. These diffusions form a natural generalization of the classical Bessel processes and skew Brownian motions, where the local time refers to the constant function γ≡0.     

Nonexistence of Complete (st−t/s)-Arcs in Generalized Quadrangles of Order (s, t), I

Let $\text{S}$ be a finite generalized quadrangle (GQ) of order (s, t), s≠1≠t. A k-arc $\text{K}$ is a set of k mutually non-collinear points. For any k-arc of $\text{S}$ we have k⩽st+1; if k=st+1, then $\text{K}$ is an ovoid of $\text{S}$. A k-arc is complete if it is not contained in a k′-arc with k′>k. In S. E. Payne and J. A. Thas, Finite Generalized Quadrangles, Pitman, Boston, 1984, it is proved that an (st−m)-arc, where −1⩽m<t/s, is always contained in a uniquely defined ovoid, hence it is a natural question to ask whether or not complete (st−t/s)-arcs exist. In this note, we prove that the classical GQ H(4, q²) has no complete (q⁵−q)-arcs. We also show that a GQ $\text{S}$ of order s with a regular point has no complete (s²−1)-arcs, except when s=2, i.e. $\text{S}$≅$\text{Q}$(4, 2), and in that case there is a unique example. As a by-product there follows that no known GQ of even order s with s>2 can have complete (s²−1)-arcs. Also, we prove that a GQ of order (s, s²), s≠1, cannot have complete (s³−s)-arcs unless s=2, i.e., $\text{S}$≅$\text{Q}$(5, 2), in which case there is a unique example (up to isomorphism).     

Asymptotic enumeration of dense 0-1 matrices with specified line sums

Let s=(s₁,s₂,…,sm) and t=(t₁,t₂,…,tn) be vectors of non-negative integers with . Let B(s,t) be the number of m×n matrices over {0,1} with jth row sum equal to sj for 1?j?m and kth column sum equal to tk for 1?k?n. Equivalently, B(s,t) is the number of bipartite graphs with m vertices in one part with degrees given by s, and n vertices in the other part with degrees given by t. Most research on the asymptotics of B(s,t) has focused on the sparse case, where the best result is that of Greenhill, McKay and Wang (2006). In the case of dense matrices, the only precise result is for the case of equal row sums and equal column sums (Canfield and McKay, 2005). This paper extends the analytic methods used by the latter paper to the case where the row and column sums can vary within certain limits. Interestingly, the result can be expressed by the same formula which holds in the sparse case.     

Non-triviality of a product in the Adams <Emphasis Type="Italic">E</Emphasis> <Subscript>2</Subscript>-term

Let p be a prime greater than five and A the mod p Steenrod algebra. In this paper, we prove that \(h_n h_m \tilde \delta _{s + 4} \in Ext_A^{s + 6,t(s,n,m) + s} (Z/p,Z/p)\) is nontrivial in the Adams E₂-term when m ≥ n + 2 ≥ 7 and 0 ≤ s < p ? 4, and trivial in the Adams E₂-term when m ≥ n + 2 = 6 and 0 ≤ s < p ? 4, where \(\tilde \delta _{s + 4} \) stands for the fourth Greek letter element and t(s, n, m) = 2(p ? 1)[(s + 1) + (s + 2)p + (s + 3)p² + (s + 4)p³ + pⁿ + p^m].     

On cyclic decompositions of the complete graph into the 2-regular graphs

The symbol C(m₁ ⁿ ₁m₂ ⁿ ₂...m_s ⁿ _s) denotes a 2-regular graph consisting ofn _i cycles of lengthm _i , i=1, 2,…,s. In this paper, we give some construction methods of cyclic(K _v ,G)-designs, and prove that there exists a cyclic(K _v , G)-design whenG=C((4m ₁) ⁿ ₁(4m ₂) ⁿ ₂...(4m _s ) ⁿ _s andv ≡ 1 (mod 2¦G¦).     

A restriction on the parameters of a suboctagon

If a generalized octagon with parameters (s, t) for t > s has a proper suboctagon with parameters (s₁, t₁), then st ? s₁²t₁.     

On a nonlinear Volterra integral equation in a Banach space

The equation u(t) + ∝₀^tk(t ? s)g(s) ds?f(t), t ? 0, is studied in a real Banach space with uniformly convex dual. Conditions, sufficient for the existence of a unique solution, are given for the operatorvalued kernel k, the nonlinear m-accretive operators g(t) and the function f. The case when k is realvalued, g(t) ≡ g and X a reflexive Banach space is also considered. These results extend earlier results by Barbu, Londen and MacCamy.