We develop a fast algorithm for the construction of good rank-1 lattice rules which are a quasi-Monte Carlo method for the approximation of multivariate integrals. A popular method to construct such rules is the component-by-component algorithm which is able to construct good lattice rules that achieve the optimal theoretical rate of convergence. The construction time of this algorithm is O(sn)...

In ‎this ‎paper, ‎we ‎study ‎the ‎relation ‎between ‎the ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎with ‎the ‎lattice theory. ‎We ‎introduce ‎the ‎concepts ‎of ‎the ‎lattice ‎of ‎soft ‎sets, ‎full ‎soft ‎sets ‎and ‎soft ‎Lie ‎algebras ‎and next, we ‎verify ‎some ‎properties ‎of ‎them. We ‎prove ‎that ‎the ‎lattice ‎of ‎the ‎soft ‎sets ‎on ‎a fixed parameter set is isomorphic to the power set of a ...

Let k be a positive integer, a subset Q of the set of vertices of a graph G is k-dependent in G if each vertex of Q has no more than k neighbours in Q. We present a parallel algorithm which computes a maximal k-dependent set in a graph on n nodes in time O(log 4 n) on an EREW PRAM with O(n 2) processors. In this way, we establish the membership of the problem of constructing a maximal k-depende...

In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.

Let p be an odd prime number, k an imaginary abelian field containing a primitive p-th root of unity, and k∞/k the cyclotomic Zp-extension. Denote by L/k∞ the maximal unramified pro–p abelian extension, and by L′ the maximal intermediate field of L/k∞ in which all prime divisors of k∞ over p split completely. Let N/k∞ (resp. N ′/k∞) be the pro–p abelian extension generated by all p-power roots ...

The authors present a method for decomposition of Bayesian networks into their maximal prime subgraphs. The correctness of the method is proven and results relating the maximal prime subgraph decomposition (MPD) to the maximal complete subgraphs of the moral graph of the original Bayesian network are presented. The maximal prime subgraphs of a Bayesian network can be organized as a tree which c...

Let $p$ be a prime, let $K$ discretely valued extension of $\mathbb{Q}_p$, and $A_{K}$ an abelian $K$-variety with semistable reduction. Extending work by Kim Marshall from the case where $p>2$ $K/\mathbb{Q}_p$ is unramified, we prove $l=p$ complement Galois cohomological formula Grothendieck for $l$-primary part N\'eron component group $A_{K}$. Our proof involves constructing, each $m\in \math...

Long binary sequences related to cyclic difference sets are investigated. Among all known constructions of cyclic difference sets we show that only sequences constructed from Hadamard difference sets can have an asymptotic nonzero merit factor. Maximal length shift register sequences, Legendre, and twin-prime sequences are all constructed from Hadamard difference sets. We prove that the asympto...

Abstract We prove that an n-component fibered link L in S3 is strongly quasi-positive if and only $\tau(L)=g_3(L)+n-1$, where $g_3(L)$ denotes the Seifert genus τ Ozsváth–Szabó concordance invariant. also provide a table which contains list of some prime links with at most 9 crossings; we explicitly determine ones are their maximal self-linking number.

We present an algorithm that computes the product of two n-bit integers in O(n log n (4\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n}). We also prove that for a fixed prime p, polynomials in F_p[X] of degree n may be multiplied in O(n log n 4^{log^* n}) bit operations; the previous best bound was O(n log n 8^{log^* n}).