The k-error linear complexity distribution for 2^n-periodic binary sequences

The linear complexity and the \(k\) -error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, we investigate the \(k\) -error linear complexity distribution of \(2^n\) -periodic binary sequences in this paper based on Games–Chan algorithm. First, for \(k=2,3\) , the complete counting functions for the \(k\) -error linear complexity of \(2^n\) -periodic binary sequences (with linear complexity less than \(2^n\) ) are characterized. Second, for \(k=3,4\) , the complete counting functions for the \(k\) -error linear complexity of \(2^n\) -periodic binary sequences with linear complexity \(2^n\) are presented. Third, as a consequence of these results, the counting functions for the number of \(2^n\) -periodic binary sequences with the \(k\) -error linear complexity for \(k = 2\) and \(3\) are obtained.     

Bounding the exponent of a verbal subgroup

We deal with the following conjecture. If \(w\) is a group word and \(G\) is a finite group in which any nilpotent subgroup generated by \(w\) -values has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only. We show that this is true in the case where \(w\) is either the \(n\text{ th }\) Engel word or the word \([x^n,y_1,y_2,\ldots ,y_k]\) (Theorem A). Further, we show that for any positive integer \(e\) there exists a number \(k=k(e)\) such that if \(w\) is a word and \(G\) is a finite group in which any nilpotent subgroup generated by products of \(k\) values of the word \(w\) has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only (Theorem B).     

The {\mathcal {A}}-Truncated K-Moment Problem

Let \({\mathcal {A}}\subseteq {\mathbb {N}}^n\) be a finite set, and \(K\subseteq {\mathbb {R}}^n\) be a compact semialgebraic set. An \({\mathcal {A}}\) -truncated multisequence ( \({\mathcal {A}}\) -tms) is a vector \(y=(y_{\alpha })\) indexed by elements in \({\mathcal {A}}\) . The \({\mathcal {A}}\) -truncated \(K\) -moment problem ( \({\mathcal {A}}\) -TKMP) concerns whether or not a given \({\mathcal {A}}\) -tms \(y\) admits a \(K\) -measure \(\mu \) , i.e., \(\mu \) is a nonnegative Borel measure supported in \(K\) such that \(y_\alpha = \int _K x^\alpha \mathtt {d}\mu \) for all \(\alpha \in {\mathcal {A}}\) . This paper proposes a numerical algorithm for solving \({\mathcal {A}}\) -TKMPs. It aims at finding a flat extension of \(y\) by solving a hierarchy of semidefinite relaxations \(\{(\mathtt {SDR})_k\}_{k=1}^\infty \) for a moment optimization problem, whose objective \(R\) is generated in a certain randomized way. If \(y\) admits no \(K\) -measures and \({\mathbb {R}}[x]_{{\mathcal {A}}}\) is \(K\) -full (there exists \(p \in {\mathbb {R}}[x]_{{\mathcal {A}}}\) that is positive on \(K\) ), then \((\mathtt {SDR})_k\) is infeasible for all \(k\) big enough, which gives a certificate for the nonexistence of representing measures. If \(y\) admits a \(K\) -measure, then for almost all generated \(R\) , this algorithm has the following properties: i) we can asymptotically get a flat extension of \(y\) by solving the hierarchy \(\{(\mathtt {SDR})_k\}_{k=1}^\infty \) ; ii) under a general condition that is almost sufficient and necessary, we can get a flat extension of \(y\) by solving \((\mathtt {SDR})_k\) for some \(k\) ; iii) the obtained flat extensions admit a \(r\) -atomic \(K\) -measure with \(r\le |{\mathcal {A}}|\) . The decomposition problems for completely positive matrices and sums of even powers of real linear forms, and the standard truncated \(K\) -moment problems, are special cases of \({\mathcal {A}}\) -TKMPs. They can be solved numerically by this algorithm.     

Neighbour-transitive codes in Johnson graphs

The Johnson graph \(J(v,k)\) has, as vertices, the \(k\) -subsets of a \(v\) -set \(\mathcal {V}\) and as edges the pairs of \(k\) -subsets with intersection of size \(k-1\) . We introduce the notion of a neighbour-transitive code in \(J(v,k)\) . This is a proper vertex subset \(\Gamma \) such that the subgroup \(G\) of graph automorphisms leaving \(\Gamma \) invariant is transitive on both the set \(\Gamma \) of ‘codewords’ and also the set of ‘neighbours’ of \(\Gamma \) , which are the non-codewords joined by an edge to some codeword. We classify all examples where the group \(G\) is a subgroup of the symmetric group \(\mathrm{Sym}\,(\mathcal {V})\) and is intransitive or imprimitive on the underlying \(v\) -set \(\mathcal {V}\) . In the remaining case where \(G\le \mathrm{Sym}\,(\mathcal {V})\) and \(G\) is primitive on \(\mathcal {V}\) , we prove that, provided distinct codewords are at distance at least \(3\) , then \(G\) is \(2\) -transitive on \(\mathcal {V}\) . We examine many of the infinite families of finite \(2\) -transitive permutation groups and construct surprisingly rich families of examples of neighbour-transitive codes. A major unresolved case remains.     

Global solutions of non-Lipschitz S_{2}–S_{p} minimization over the positive semidefinite cone

The \(S_2\) – \(S_p\) minimization over the positive semidefinite cone is the semidefinite least squares problem with Schatten \(p\) -quasi ( \(0 ) norm regularization term. It has wide applications in many areas including compressed sensing, control, statistics, signal and image processing, etc. In this paper, by developing the symmetric matrix \(\mathrm {p}\) -thresholding operator representation theory, we establish the necessary condition for global optimal solutions of \(S_2\) – \(S_p\) minimization, and also provide the exact lower bound for the positive eigenvalues at global optimal solutions.     

Uncertainty principles and sum complexes

Let \(p\) be a prime and let \(A\) be a nonempty subset of the cyclic group \(C_p\) . For a field \({\mathbb F}\) and an element \(f\) in the group algebra \({\mathbb F}[C_p]\) let \(T_f\) be the endomorphism of \({\mathbb F}[C_p]\) given by \(T_f(g)=fg\) . The uncertainty number \(u_{{\mathbb F}}(A)\) is the minimal rank of \(T_f\) over all nonzero \(f \in {\mathbb F}[C_p]\) such that \(\mathrm{supp}(f) \subset A\) . The following topological characterization of uncertainty numbers is established. For \(1 \le k \le p\) define the sum complex \(X_{A,k}\) as the \((k-1)\) -dimensional complex on the vertex set \(C_p\) with a full \((k-2)\) -skeleton whose \((k-1)\) -faces are all \(\sigma \subset C_p\) such that \(|\sigma |=k\) and \(\prod _{x \in \sigma }x \in A\) . It is shown that if \({\mathbb F}\) is algebraically closed then $$\begin{aligned} u_{{\mathbb F}}(A)=p-\max \{k :\tilde{H}_{k-1}(X_{A,k};{\mathbb F}) \ne 0\}. \end{aligned}$$ The main ingredient in the proof is the determination of the homology groups of \(X_{A,k}\) with field coefficients. In particular it is shown that if \(|A| \le k\) then \(\tilde{H}_{k-1}(X_{A,k};{\mathbb F}_p)\!=\!0.\)      

Mean Squared Error Minimization for Inverse Moment Problems

We consider the problem of approximating the unknown density \(u\in L^2(\Omega ,\lambda )\) of a measure \(\mu \) on \(\Omega \subset \mathbb {R}^n\) , absolutely continuous with respect to some given reference measure \(\lambda \) , only from the knowledge of finitely many moments of \(\mu \) . Given \(d\in \mathbb {N}\) and moments of order \(d\) , we provide a polynomial \(p_d\) which minimizes the mean square error \(\int (u-p)^2d\lambda \) over all polynomials \(p\) of degree at most \(d\) . If there is no additional requirement, \(p_d\) is obtained as solution of a linear system. In addition, if \(p_d\) is expressed in the basis of polynomials that are orthonormal with respect to \(\lambda \) , its vector of coefficients is just the vector of given moments and no computation is needed. Moreover \(p_d\rightarrow u\) in \(L^2(\Omega ,\lambda )\) as \(d\rightarrow \infty \) . In general nonnegativity of \(p_d\) is not guaranteed even though \(u\) is nonnegative. However, with this additional nonnegativity requirement one obtains analogous results but computing \(p_d\ge 0\) that minimizes \(\int (u-p)^2d\lambda \) now requires solving an appropriate semidefinite program. We have tested the approach on some applications arising from the reconstruction of geometrical objects and the approximation of solutions of nonlinear differential equations. In all cases our results are significantly better than those obtained with the maximum entropy technique for estimating \(u\) .     

On matching cover of graphs

A k-matching cover of a graph \(G\) is a union of \(k\) matchings of \(G\) which covers \(V(G)\) . The matching cover number of \(G\) , denoted by \(mc(G)\) , is the minimum number \(k\) such that \(G\) has a \(k\) -matching cover. A matching cover of \(G\) is optimal if it consists of \(mc(G)\) matchings of \(G\) . In this paper, we present an algorithm for finding an optimal matching cover of a graph on \(n\) vertices in \(O(n^3)\) time (if use a faster maximum matching algorithm, the time complexity can be reduced to \(O(nm)\) , where \(m=|E(G)|\) ), and give an upper bound on matching cover number of graphs. In particular, for trees, a linear-time algorithm is given, and as a by-product, the matching cover number of trees is determined.     

On the non-existence of maximal difference matrices of deficiency 1

A \(k\times u\lambda \) matrix \(M=[d_{ij}]\) with entries from a group \(U\) of order \(u\) is called a \((u,k,\lambda )\) -difference matrix over \(U\) if the list of quotients \(d_{i\ell }{d_{j\ell }}^{-1}, 1 \le \ell \le u\lambda ,\) contains each element of \(U\) exactly \(\lambda \) times for all \(i\ne j.\) Jungnickel has shown that \(k \le u\lambda \) and it is conjectured that the equality holds only if \(U\) is a \(p\) -group for a prime \(p.\) On the other hand, Winterhof has shown that some known results on the non-existence of \((u,u\lambda ,\lambda )\) -difference matrices are extended to \((u,u\lambda -1,\lambda )\) -difference matrices. This fact suggests us that there is a close connection between these two cases. In this article we show that any \((u,u\lambda -1,\lambda )\) -difference matrix over an abelian \(p\) -group can be extended to a \((u,u\lambda ,\lambda )\) -difference matrix.     

On an extension of the Frobenius^{\prime } theorem about p-nilpotency of a finite group

Suppose that \(G\) is a finite group and \(H\) is a subgroup of \(G\) . \(H\) is said to be \(s\) -quasinormally embedded in \(G\) if for each prime \(p\) dividing the order of \(H\) , a Sylow \(p\) -subgroup of \(H\) is also a Sylow \(p\) -subgroup of some \(s\) -quasinormal subgroup of \(G\) . We fix in every non-cyclic Sylow subgroup \(P\) of \(G\) some subgroup \(D\) satisfying \(1<|D|<|P|\) and study the \(p\) -nilpotency of \(G\) under the assumption that every subgroup \(H\) of \(P\) with \(|H|=|D|\) is \(s\) -quasinormally embedded in \(G\) . Some recent results and the Frobenius \(^{\prime }\) theorem are generalized.     

On an extension of the H^{k} mean curvature flow of closed convex hypersurfaces

In this paper we prove that the \(H^{k}\) ( \(k\) is odd and larger than \(2\) ) mean curvature flow of a closed convex hypersurface can be extended over the maximal time provided that the total \(L^{p}\) integral of the mean curvature is finite for some \(p\) .     

Orbit structure of a distinguished Stein invariant domain in the complexification of a Hermitian symmetric space

Recently, Bruinier and Ono proved that the coefficients of certain weight \(-1/2\) harmonic weak Maaß forms are given as “traces” of singular moduli for harmonic weak Maaß forms. Here, we prove that similar results hold for the coefficients of harmonic weak Maaß forms of weight \(3/2+k\) , \(k\) even, and weight \(1/2-k\) , \(k\) odd, by extending the theta lift of Bruinier–Funke and Bruinier–Ono. Moreover, we generalize these results to include twisted traces of singular moduli using earlier work of the author and Ehlen on the twisted Bruinier–Funke-lift. Employing a general duality result between weight \(k\) and \(2-k\) , we obtain formulas for all half-integral weights. We also show that the non-holomorphic part of the theta lift in weight \(1/2-k\) , \(k\) odd, is connected to the vanishing of the special value of the \(L\) -function of a certain derivative of the lifted function.     

Endomorphism rings of bimodules

Let \(M\) be an \(R\) - \(R\) -bimodule over a semi-prime right and left Goldie ring \(R\) . We investigate how non-singularity conditions on \(M_R\) are related to such conditions on \(_RM\) . In particular, we say an \(R\) - \(R\) -bimodule \(M\) such that \(_RM\) and \(M_R\) are non-singular has the right essentiality property if \(IM_R\) is essential in \(M_R\) for all essential right ideals \(I\) of \(R\) , and investigate several questions related to this property.     

On weakly closed subgroups of finite groups

Suppose that \(G\) is a finite group and \(H\) , \(K\) are subgroups of \(G\) . We say that \(H\) is weakly closed in \(K\) with respect to \(G\) if, for any \(g \in G\) such that \(H^{g}\le K\) , we have \(H^{g}=H\) . In particular, when \(H\) is a subgroup of prime-power order and \(K\) is a Sylow subgroup containing it, \(H\) is simply said to be a weakly closed subgroup of \(G\) or weakly closed in \(G\) . In the paper, we investigate the structure of finite groups by means of weakly closed subgroups.     

Refined methods for the identifiability of tensors

We prove that the general tensor of size \(2^n\) and rank \(k\) has a unique decomposition as the sum of decomposable tensors if \(k\le 0.9997\frac{2^n}{n+1}\) (the constant 1 being the optimal value). Similarly, the general tensor of size \(3^n\) and rank \(k\) has a unique decomposition as the sum of decomposable tensors if \(k\le 0.998\frac{3^n}{2n+1}\) (the constant 1 being the optimal value). Some results of this flavor are obtained for tensors of any size, but the explicit bounds obtained are weaker.     

t-Structures and cotilting modules over commutative noetherian rings

For a commutative noetherian ring \(R\) , we establish a bijection between the resolving subcategories consisting of finitely generated \(R\) -modules of finite projective dimension and the compactly generated t-structures in the unbounded derived category \(\mathcal {D}(R)\) that contain \(R[1]\) in their heart. Under this bijection, the t-structures \((\mathcal U,\mathcal V)\) such that the aisle \(\mathcal U\) consists of objects with homology concentrated in degrees \(<n\) correspond to the \(n\) -cotilting classes in \({{\mathrm{Mod}\text {-}R}}\) . As a consequence of these results, we prove that the little finitistic dimension findim \(R\) of \(R\) equals an integer \(n\) if and only if the direct sum \(\bigoplus _{k=0}^n E_k(R)\) of the first \(n+1\) terms in a minimal injective coresolution \(0\rightarrow R\rightarrow E_0(R)\rightarrow E_1(R)\rightarrow \cdots \) of \(R\) is an injective cogenerator of \({{\mathrm{Mod}\text {-}R}}\) .     

On the commuting probability and supersolvability of finite groups

For a finite group \(G\) , let \(d(G)\) denote the probability that a randomly chosen pair of elements of \(G\) commute. We prove that if \(d(G)>1/s\) for some integer \(s>1\) and \(G\) splits over an abelian normal nontrivial subgroup \(N\) , then \(G\) has a nontrivial conjugacy class inside \(N\) of size at most \(s-1\) . We also extend two results of Barry, MacHale, and Ní Shé on the commuting probability in connection with supersolvability of finite groups. In particular, we prove that if \(d(G)>5/16\) then either \(G\) is supersolvable, or \(G\) isoclinic to \(A_4\) , or \(G/\mathbf{Z}(G)\) is isoclinic to \(A_4\) .     

Randomized large distortion dimension reduction

Consider a random matrix \(H:{\mathbb {R}}^{n}\longrightarrow {\mathbb {R}}^{m}\) . Let \(D\ge 2\) and let \(\{W_l\}_{l=1}^{p}\) be a set of \(k\) -dimensional affine subspaces of \({\mathbb {R}}^{n}\) . We ask what is the probability that for all \(1\le l\le p\) and \(x,y\in W_l\) , $$\begin{aligned} \Vert x-y\Vert _2\le \Vert Hx-Hy\Vert _2\le D\Vert x-y\Vert _2. \end{aligned}$$ We show that for \(m=O\big (k+\frac{\ln {p}}{\ln {D}}\big )\) and a variety of different classes of random matrices \(H\) , which include the class of Gaussian matrices, existence is assured and the probability is very high. The estimate on \(m\) is tight in terms of \(k,p,D\) .     

On extensions of completely simple semigroups by groups

An example of an extension of a completely simple semigroup \(U\) by a group \(H\) is given which cannot be embedded into the wreath product of \(U\) by \(H\) . On the other hand, every central extension of \(U\) by \(H\) is shown to be embeddable in the wreath product of \(U\) by \(H\) , and any extension of \(U\) by \(H\) is proved to be embeddable in a semidirect product of a completely simple semigroup \(V\) by \(H\) where the maximal subgroups of \(V\) are direct powers of those of \(U\) .     

Some totally geodesic submanifolds of the nonlinear Grassmannian of a compact symmetric space

Let \(M\) and \(N\) be two connected smooth manifolds, where \(M\) is compact and oriented and \(N\) is Riemannian. Let \(\mathcal {E}\) be the Fréchet manifold of all embeddings of \(M\) in \(N\) , endowed with the canonical weak Riemannian metric. Let \(\sim \) be the equivalence relation on \(\mathcal {E}\) defined by \(f\sim g\) if and only if \(f=g\circ \phi \) for some orientation preserving diffeomorphism \(\phi \) of \(M\) . The Fréchet manifold \(\mathcal {S}= \mathcal {E}/_{\sim }\) of equivalence classes, which may be thought of as the set of submanifolds of \(N\) diffeomorphic to \(M\) and is called the nonlinear Grassmannian (or Chow manifold) of \(N\) of type \(M\) , inherits from \( \mathcal {E}\) a weak Riemannian structure. We consider the following particular case: \(N\) is a compact irreducible symmetric space and \(M\) is a reflective submanifold of \(N\) (that is, a connected component of the set of fixed points of an involutive isometry of \( N\) ). Let \(\mathcal {C}\) be the set of submanifolds of \(N\) which are congruent to \(M\) . We prove that the natural inclusion of \(\mathcal {C}\) in \(\mathcal {S}\) is totally geodesic.