Resolvable decomposition of Kn1

In this paper, we prove that $\text{K}{}_{\mathrm{n}}{}^1$ admits a resolvable decomposition into TT₃ or C₃ if and only if n ≡ 0 (mod. 3), n ≠ 6.     

Almost resolvable decomposition of Kn1

In this paper, we show that the complete symmetric directed graph with n vertices $\text{K}{}_{\mathrm{n}}{}^1$ admits an almost resolvable decomposition into TT₃ (the transitive tournament on 3 vertices) or C₃ (the directed cycle of length 3) if and only if n ≡ 1(mod 3).     

A Hamiltonian decomposition of K2m1, 2m ≥ 8

It is shown that $\text{K}{}_{\mathrm{2m}}{}^1$, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct construction utilizing difference methods is given for 2m ≡ 0 (mod 4). The case 2m ≡ 2 (mod 4) is handled inductively by means of a construction which shows that $\text{K}{}_{\mathrm{4m\; ?\; 2}}{}^1$ admits such a decomposition if $\text{K}{}_{\mathrm{2m}}{}^1$ does.     

On the closability of some positive definite symmetric differential forms on c0∞(ω)

Let $\text{S}$ be a Dirichlet form in $\text{L}{}^2\text{(Ω; m)}$, where Ω is an open subset of $\text{R}$ⁿ, n ? 2, and m a Radon measure on Ω; for each integer k with 1 ? k < n, let $\text{S}$_k be a Dirichlet form on some k-dimensional submanifold $\text{Ω}{}_{\mathrm{k}}$ of Ω. The paper is devoted to the study of the closability of the forms E with domain $\text{C}{}_0{}^{\mathrm{\infty }}\text{(Ω)}$ and defined by: $\text{(?,g)=}$$\text{E}$$\text{(?, g)+}\text{∑}\text{i}\text{p}\text{=1}$$\text{E}$k_i where 1 ? k_p < ? < n, and where , g^k_i denote restrictions of ?, g in $\text{C}{}_0{}^{\mathrm{\infty }}\text{(Ω)}$ to . Conditions are given for E to be closable if, for each i = 1,…, p, one has k_i = n ? i. Other conditions are given for E to be nonclosable if, for some i, k_i < n ? i.     

The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)

We study the weight distribution of irreducible cyclic (n, k) codeswith block lengths n = n₁((q¹ ? 1)/N), where N|q ? 1, gcd(n₁,N) = 1, and gcd(l,N) = 1. We present the weight enumerator polynomial, A(z), when k = n₁l, k = (n₁ ? 1)l, and k = 2l. We also show how to find A(z) in general by studying the generator matrix of an (n₁, m) linear code, $\text{V}{}^1{}_{\mathrm{d}}$ over GF(q^d) where d = gcd (ord_n1(q), l). Specifically we study A(z) when $\text{V}{}^1{}_{\mathrm{d}}$ is a maximum distance separable code, a maximal shiftregister code, and a semiprimitive code. We tabulate some numbers A_μ which completely determine the weight distributionof any irreducible cyclic (n₁(2¹ ? 1), k) code over GF(2) for all n₁ ? 17.     

The covering problem for the fields Q(−1)12 and Q(−3)12

Let k be a positive square free integer, $\text{N(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ the ring of algebraic integers in $\text{Q(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ and S the unit sphere in C_n, complex n-space. If A₁,…, A_n are n linearly independent points of C_n then L = {u₁Au + … + u_nA_n} with $\text{u}{}_{\mathrm{r}}\text{∈ N(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is called a k-lattice. The determinant of L is denoted by d(L). If L is a covering lattice for S, then $\text{θ(S, L) =}\text{V(S)}\text{d(L)}$ is the covering density. L is called locally (absolutely) extreme if θ(S, L) is a local (absolute) minimum. In this paper we determine unique classes of extreme lattices for k = 1 and k = 3.     

Cesàro asymptotics for the orders of SLk(Zn) and GLk(Zn) as n→∞

Given an integer k>0, our main result states that the sequence of orders of the groups $\text{SL}{}_{\mathrm{k}}\text{(}\text{Z}{}_{\mathrm{n}}\text{)}$ (respectively, of the groups $\text{GL}{}_{\mathrm{k}}\text{(}\text{Z}{}_{\mathrm{n}}\text{)}$) is Cesàro equivalent as n→∞ to the sequence C₁(k)n^k2?1 (respectively, C₂(k)n^k2), where the coefficients C₁(k) and C₂(k) depend only on k; we give explicit formulas for C₁(k) and C₂(k). This result generalizes the theorem (which was first published by I. Schoenberg) that says that the Euler function ?(n) is Cesàro equivalent to $\text{n}\text{6}\text{π}{}^2$. We present some experimental facts related to the main result. To cite this article: A.G. Gorinov, S.V. Shadchin, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Arithmetic in generalized Artin-Schreier extensions of k(x)

If k is a perfect field of characteristic p ≠ 0 and k(x) is the rational function field over k, it is possible to construct cyclic extensions K_n over k(x) such that [K : k(x)] = pⁿ using the concept of Witt vectors. This is accomplished in the following way; if [β₁, β₂,…, β_n] is a Witt vector over k(x) = K₀, then the Witt equation $\text{y}{}^{\mathrm{p}}\text{?}\text{y}\text{= β}$ generates a tower of extensions through $\text{K}{}_{\mathrm{i}}\text{= K}{}_{\mathrm{i?1}}\text{(}\text{y}{}_{\mathrm{i}}\text{)}$ where $\text{y}\text{= [}\text{y}{}_1\text{,}\text{y}{}_2\text{,…,}\text{y}{}_{\mathrm{n}}\text{]}$. In this paper, it is shown that there exists an alternate method of generating this tower which lends itself better for further constructions in K_n. This alternate generation has the form K_i = K_i?1(y_i); y_i^p ? y_i = B_i, where, as a divisor in K_i?1, B_i has the form . In this form q is prime to Πp_j^λ_j and each λ_j is positive and prime to p. As an application of this, the alternate generation is used to construct a lower-triangular form of the Hasse-Witt matrix of such a field K_n over an algebraically closed field of constants.     

Convex polyhedra of doubly stochastic matrices: II. Graph of Ωn

Properties of the graph $\text{G(Ω}{}_{\mathrm{n}}\text{)}$ of the polytope $\text{Ω}{}_{\mathrm{n}}$ of all n × n nonnegative doubly stochastic matrices are studied. If $\text{F}$ is a face of $\text{Ω}{}_{\mathrm{n}}$ which is not a k-dimensional rectangular parallelotope for k ≥ 2, then G($\text{F}$) is Hamilton connected. Prime factor decompositions of the graphs of faces of $\text{Ω}{}_{\mathrm{n}}$ relative to Cartesian product are investigated. In particular, if $\text{F}$ is a face of $\text{Ω}{}_{\mathrm{n}}$, then the number of prime graphs in any prime factor decomposition of G($\text{F}$) equals the number of connected components of the neighborhood of any vertex of G($\text{F}$). Distance properties of the graphs of faces of $\text{Ω}{}_{\mathrm{n}}$ are obtained. Faces $\text{F}$ of $\text{Ω}{}_{\mathrm{n}}$ for which G($\text{F}$) is a clique of $\text{G(Ω}{}_{\mathrm{n}}\text{)}$ are investigated.     

On the expansion of Cϱ1(V + I) as a sum of zonal polynomials

The coefficients a_τ?, sometimes called “generalized binomial coefficients” in the expansion $\text{C}{}_{\mathrm{?}}{}^1\text{(V +I) = Σ}{}_{\mathrm{\tau }}\text{a}{}_{\mathrm{?\tau }}\text{C}{}_{\mathrm{\tau }}{}^1\text{(V)}$, are computed explicitly when t = r + 1, where ? is a partition of r and τ a partition of t. A recursion formula permits the calculation of the general a_τ?. Several properties of a_τ? are proved. A connection between the a_τ? and other coefficients is established. The main tools used are Bingham's identity, results from the theory of invariant differential operators, and a lemma concerning zonal polynomials.     

K2 and K3 of the circle

Let k be $\text{Z}\text{[}\text{1}\text{2}\text{]}$, $\text{Q}$ or $\text{R}$, and set $\text{A =}\text{k[x,y]}\text{(x}{}^2\text{+ y}{}^2\text{? 1)}$. We compute K₂(A) and K₃(A). Our method is to construct a map $\text{? : K}{}_1\text{(k[i])→K}{}_{\mathrm{1\; +\; 1}}\text{(A)}$ and compare this to a localization sequence.We give three applications. We show that ? accounts for the primitive elements in K₂(A), and compare our results to computations of Bloch [1] for group schemes. Secondly, we consider the problem of basepoint independence, and indicate the interplay of geometry upon the K-theory of affine schemes obtained by glueing points of Spec(A). Third, we can iterate the construction to compute the K-theory of the torus ring A ?_kA.     

On the series Σk = 1∞(k2k)−1k−n and related sums

Series of the form $\text{Σ}{}_{\mathrm{k\; =\; 1}}{}^{\mathrm{\infty }}\text{(}\text{2k}\text{2k}\text{)}{}^{\mathrm{?1}}\text{k}{}^{\mathrm{?n}}$ may be expressed as log sin integrals and are shown to be summable exactly in terms of Dirichlets L-series for values of n up to and including 5. Other related series are also discussed and several exact results are given.     

Extensions of factorial states of C1-algebras

Let A be a $\text{C}{}^1$-algebra, B be a $\text{C}{}^1$-subalgebra of A, and φ be a factorial state of B. Sometimes, φ may be extended to a factorial state of A by a tensor product method of Sakai (“$\text{C}{}^1$-algebras and $\text{W}{}^1$-algebras, Springer-Verlag, Berlin/Heidelberg/ New York 1971”). Sometimes, there is a weak expectation of A into $\text{π}{}_{\mathrm{\phi }}\text{(B)}$, and then factorial extensions may be found by a method of Sakai and Tsui (Yokohama Math. J.29 (1981), 157–160). These two methods are shown to have the same effect, and the factorial extensions produced by them are analysed.     

On the invariants of some Zi-extensions

Let k ? k₁ ? … ? K be a Z_i-extension. The relations of $\text{λ(}\text{K}\text{k}\text{)}$ and $\text{λ(}\text{KF}\text{F}\text{)}$ is studied, where $\text{F}\text{k}$ is a cyclic l-extension. If $\text{M}\text{k}$ is another Z_i-extension of k, it is shown that for i ? 0$\text{λ(}\text{Mk}{}_{\mathrm{i}}\text{k}{}_{\mathrm{i}}\text{) = rl}{}^{\mathrm{i}}\text{+ C}$, under minimal additional hypotheses. Finally if $\text{MK}\text{k}$ has a unique totally ramified prime, and X_K is cyclic, it is shown that MK can contain at most one Z_i-extension with non-zero μ invariant.     

Derivations of Witt vectors with application to K2 of truncated polynomial rings and Laurent series

The absolute Kähler module $\text{Ω}{}_{\mathrm{w}}{}_{\mathrm{n}}{}^{\mathrm{(k)}}$ of the truncated generalized Witt vectors of a field k of positive characteristic is zero if and only if k is perfect. This recovers known information on $\text{K}{}_2\text{(}\text{k[t]}\text{(t}{}^{\mathrm{n}}\text{)}\text{)}$ with which the structure of K₂(k((t))) can be studied.     

On the fair coin tossing process

Let Ω = {1, 0} and for each integer n ≥ 1 let $\text{Ω}{}_{\mathrm{n}}\text{= Ω × Ω × … × Ω}$ (n-tuple) and $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}\text{= {(a}{}_1\text{, a}{}_2\text{, …, a}{}_{\mathrm{n}}\text{)|(a}{}_1\text{, a}{}_2\text{, … , a}{}_{\mathrm{n}}\text{) ? Ω}{}_{\mathrm{n}}\text{and}\text{Σ}{}_{\mathrm{i=1}}{}^{\mathrm{n}}\text{a}{}_{\mathrm{i}}\text{= k}}$ for all k = 0,1,…,n. Let {Y_m}_m≥1 be a sequence of i.i.d. random variables such that $\text{P(Y}{}_1\text{= 0) = P(Y}{}_1\text{= 1) =}\text{1}\text{2}$. For each A in $\text{Ω}{}_{\mathrm{n}}$, let T_A be the first occurrence time of A with respect to the stochastic process {Y_m}_m≥1. R. Chen and A.Zame (1979, J. Multivariate Anal. 9, 150–157) prove that if n ≥ 3, then for each element A in $\text{Ω}{}_{\mathrm{n}}$, there is an element B in $\text{Ω}{}_{\mathrm{n}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$. This result is sharpened as follows: (I) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element B also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$; (II) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A = (a₁, a₂,…,a_n) in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element C also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_A is less than T_C is greater than $\text{1}\text{2}$ if n ≠ 2m or n = 2m but a_i = a_{i + 1} for some 1 ≤ i ≤ n?1. These new results provide us with a better and deeper understanding of the fair coin tossing process.     

Multiplicativity of lp norms for matrices. II

For 1 ? p ? ∞, let

$\text{|A|}{}_{\mathrm{p}}\text{=}\text{Σ}\text{i=1}\text{m}\text{Σ}\text{j=1}\text{n}\text{, |α}{}_{\mathrm{ij}}\text{|}{}^{\mathrm{p}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}$

, be the l_p norm of an m × n complex A = (α_ij) ?C_{m × n}. The main purpose of this paper is to find, for any p, q ? 1, the best (smallest) possible constants τ(m, k, n, p, q) and σ(m, k, n, p, q) for which inequalities of the form

$\text{|AB|}{}_{\mathrm{p}}\text{? τ(m, k, n, p, q) |A|}{}_{\mathrm{p}}\text{|B|}{}_{\mathrm{q}}\text{, |AB|}{}_{\mathrm{p}}\text{? σ (m, k, n, p, q)|A|}{}_{\mathrm{q}}\text{|B|}{}_{\mathrm{p}}$

hold for all A?C_{m × k}, B?C_{k × n}. This leads to upper bounds for inner products on C^k and for ordinary l_p operator norms on C_{m × n}.     

The sum of aΩ(n) over integers n ≤ x with all prime factors between a and y

For a > 0 let $\text{ψ}{}_{\mathrm{a}}\text{(x, y) =}\text{Σ}\text{a}{}^{\mathrm{\Omega (n)}}$, the sum taken over all n, 1 ≤ n ≤ x such that if p is prime and p|n then a < p ≤ y. It is shown for u < about ($\text{log log}\text{x}\text{log log log}\text{x}$) that $\text{ψ}{}_{\mathrm{a}}\text{(x, x}{}^{\mathrm{<mtext>1</mtext><mtext>u</mtext>}}\text{) ? x(}\text{log}\text{x)}{}^{\mathrm{a?1}}\text{p}{}_{\mathrm{a}}\text{(u)}$, where p_a(u) solves a delay differential equation much like that for the Dickman function p(u), and the asymptotic behavior of p_a(u) is worked out.     

Wr,p(R)-splines

In [3] Golomb describes, for 1 < p < ∞, the H^r,p(R)-extremal extension $\text{F}{}_1$ of a function $\text{?:E → R}$ (i.e., the H^r,p-spline with knots in E) and studies the cone $\text{H}{}_{1E}{}^{\mathrm{r,p}}$ of all such splines. We study the problem of determining when $\text{F}{}_1$ is in W^r,p ≡ H^r,p ∩ L^p. If $\text{F}{}_1\text{? W}{}^{\mathrm{r,p}}$, then $\text{F}{}_1$ is called a W^r,p-spline, and we denote by $\text{W}{}_{1E}{}^{\mathrm{r,p}}$ the cone of all such splines. If E is quasiuniform, then $\text{F}{}_1\text{? W}{}^{\mathrm{r,p}}$ if and only if . The cone $\text{W}{}_{1E}{}^{\mathrm{r,p}}$ with E quasiuniform is shown to be homeomorphic to l^p. Similarly, $\text{H}{}_{1E}{}^{\mathrm{r,p}}$ is homeomorphic to h^r,p. Approximation properties of the W^r,p-splines are studied and error bounds in terms of the mesh size $\text{¦ E ¦}$ are calculated. Restricting ourselves to the case p = 2 and to quasiuniform partitions E, the second integral relation is proved and better error bounds in terms of $\text{¦ E ¦}$ are derived.     

On the length of optimal TSP circuits in sets of bounded diameter

Let V be a set of n points in R^k. Let d(V) denote the diameter of V, and l(V) denote the length of the shortest circuit which passes through all the points of V. (Such a circuit is an “optimal TSP circuit”.) l^k(n) are the extremal values of l(V) defined by l^k(n)=max{l(V)|V∈V_n^k}, where V_n^k={V|V?R^k,|V|=n, d(V)=1}. A set V∈V_n^k is “longest” if l(V)=l^k(n). In this paper, first some geometrical properties of longest sets in R² are studied which are used to obtain l²(n) for small n′s, and then asymptotic bounds on l^k(n) are derived. Let δ(V) denote the minimal distance between a pair of points in V, and let: δ^k(n)=max{δ(V)|V∈V_n^k}. It is easily observed that $\text{δ}{}^{\mathrm{k}}\text{(n)=O(n}{}^{\mathrm{<mtext>?1</mtext><mtext>k</mtext>}}\text{)}$. Hence, $\text{c}{}_{\mathrm{k}}\text{=}\text{lim sup}{}_{\mathrm{n\to \infty }}\text{δ}{}^{\mathrm{k}}\text{(n)n}{}^{\mathrm{<mtext>1</mtext><mtext>k</mtext>}}$ exists. It is shown that for all $\text{n, c}{}_{\mathrm{k}}\text{n}{}^{\mathrm{<mtext>?1</mtext><mtext>k</mtext>}}\text{≤δ}{}^{\mathrm{k}}\text{(n)}$, and hence, for all $\text{n, l}{}^{\mathrm{k}}\text{(n)≥ c}{}_{\mathrm{k}}\text{n}{}^{\mathrm{<mtext>1?1</mtext><mtext>k</mtext>}}$. For k=2, this implies that $\text{l}{}^2\text{(n)≥(}\text{π}{}^2\text{12}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>4</mtext>}}\text{n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$, which generalizes an observation of Fejes-Toth that $\text{lim}{}_{\mathrm{n\to \infty }}\text{l}{}^2\text{(n)n}{}^{\mathrm{<mtext>?1</mtext><mtext>2</mtext>}}\text{≥(}\text{π}{}^2\text{12}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>4</mtext>}}$. It is also shown that $\text{l}{}^{\mathrm{k}}\text{(n) ≤ [}\text{(3?√3)k}\text{(k?1)}\text{]nδ}{}^{\mathrm{k}}\text{(n) + o(n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{) ≤ [}\text{(3?√3)k}\text{(k?1)}\text{]n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{+ o(n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{)}$. The above upper bound is used to improve related results on longest sets in k-dimensional unit cubes obtained by Few (Mathematika2 (1955), 141–144) for almost all k′s. For k=2, Few's technique is used to show that $\text{l}{}^2\text{(n)≤(}\text{πn}\text{2}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{+ O(1)}$.