Superfield Quantization in the Sp(2)-Covariant Formalism

We generalize the rules for the superfield Sp(2)-covariant quantization of arbitrary gauge theories to the case of gauge fixing by the generating equations for the gauge functional. We consider possible realizations of the extended antibrackets and show that only one of the realizations is consistent with the extended BRST symmetry transformations in the form of the supertranslations along the Grassmann coordinates of a superspace.     

二分(0,mf-m+1)-图的正交(0,f)-因子分解

设G=(X,Y,E(G))是一个二分图,分别用V(G)=XUY和E(G)表示G的顶点集和边集.设f是定义在V(G)上的整数值函数且对(A)x∈V(G)有f(x)≥k.设H_1,H_2,…,H_k是G的k个顶点不相交的子图,且|E(H_i)|=m,1≤i≤k.本文证明了每个二分(0,mf-m+1)-图G有一个(0,f)-因子分解正交于Hi(i=1,2,…,k).     

Classification of small (0, 1) matrices

Denote by A_n the set of square (0, 1) matrices of order n. The set A_n, n ? 8, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of regular (0, 1) matrices of order 8 is 10160459763342013440. Let D_n, S_n denote the set of absolute determinant values and Smith normal forms of matrices from A_n. Denote by a_n the smallest integer not in D_n. The sets D₉ and S₉ are obtained; especially, a₉ = 103. The lower bounds for a_n, 10 ? n ? 19 (exceeding the known lower bound a_n ? 2f_n − 1, where f_n is nth Fibonacci number) are obtained. Row/permutation equivalence classes of A_n correspond to bipartite graphs with n black and n white vertices, and so the other applications of the classification are possible.     

Monotone subsequences in (0, 1)-matrices

A (0, 1)-matrix contains anS ₀(k) if it has 0-cells (i, j ₁), (i + 1,j ₂),..., (i + k – 1,j _k) for somei andj ₁ < ... < j_k, and it contains anS ₁(k) if it has 1-cells (i ₁,j), (i ₂,j + 1),...,(i _k ,j + k – 1) for somej andi ₁ < ... <i _k . We prove that ifM is anm × n rectangular (0, 1)-matrix with 1 m n whose largestk for anS ₀(k) isk ₀ m, thenM must have anS ₁(k) withk m/(k ₀ + 1). Similarly, ifM is anm × m lower-triangular matrix whose largestk for anS ₀(k) (in the cells on or below the main diagonal) isk ₀ m, thenM has anS ₁(k) withk m/(k ₀ + 1). Moreover, these results are best-possible.     

Construction of nonconvertible (0, 1) Matrices

In the present paper, the existence problem for nonconvertible (0, 1) matrices is solved completely. A similar result is obtained for the set of symmetric (0, 1)-matrices.     

(0, 1)-matrices with minimal permanents

It is shown that the permanent of a totally indecomposable (0,1)-matrix is equal to its largest row sum if and only if all its other row sums are 2. This research was supported by the U.S. Air Force Office of Scientific Research under Grant AFOSR-72-2164.     

(0, mf-k+1)-图中具有正交(0,f)-因子分解的子图

设G是一个简单图, f是定义在V(G)上的整数值函数,且m是大于等于2的整数. 讨论(0, mf-k+1)-图G的正交因子分解, 并且证明了对任意的1≤k≤m, (0, mf-k+1)-图G中存在着一个子图R, 使得R有一个(0,f)-因子分解正交于图G中的任意一个k-子图H.     

The length of a (0, 1) matrix

The length of a (0, 1) matrix (a bigraph) is defined and studied.     

A characterization of convertible (0, 1)-matrices

We characterize those (0, 1)-matrices M whose elements can be given plus or minus signs so as to yield a matrix M′ for which det M′ = perm M.     

Representing (0, 1)-matrices by boolean circuits

A boolean circuit represents an n by n(0,1)-matrix A if it correctly computes the linear transformation over GF(2) on all n unit vectors. If we only allow linear boolean functions as gates, then some matrices cannot be represented using fewer than Ω(n²/lnn) wires. We first show that using non-linear gates one can save a lot of wires: any matrix can be represented by a depth-2 circuit with O(nlnn) wires using multilinear polynomials over GF(2) of relatively small degree as gates. We then show that this cannot be substantially improved: If any two columns of an n by n(0,1)-matrix differ in at least d rows, then the matrix requires Ω(dlnn/lnlnn) wires in any depth-2 circuit, even if arbitrary boolean functions are allowed as gates.     

Ensembles de classe (0, 1, q,q + 1) de PG (d,q)

We determine all sets Q of points of any finite dimensional protective space P such that each line intersecting Q in more than one point, either is contained in Q or contains exactly one point not on Q. If P is a finite protective space of order q, these sets are the so called sets of class (0, 1, q, q + 1).     

Cotauberian Operators on L 1(0, 1) Obtained by Lifting

We show that the set \({\mathcal{T}^d(L_1(0, 1))}\) of cotauberian operators acting on L ₁(0, 1) is not open, and \({T \in \mathcal{T}^d(L_1(0, 1))}\) does not imply T** cotauberian. As a consequence, we derive that the set \({\mathcal{T}(L_\infty(0, 1))}\) of tauberian operators acting on L _∞(0, 1) is not open, and that \({T \in \mathcal{T}(L_\infty(0, 1))}\) does not imply T** tauberian.     

On t-distance sets of (0, ±1)-vectors

We consider sets of (0, +1)-vectors in R ⁿ, having exactly s non-zero positions. In some cases we give best or nearly best possible bounds for the maximal number of such vectors if all the pairwise scalar products belong to a fixed set D of integers. The investigated cases include D={ -d, d}, which corresponds to equiangular lines.