Related papers: Vanishing ideals of binary Hamming spheres
Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…
Let~$S^{n-1}\rightarrow E \rightarrow M^n$ be an oriented sphere bundle supporting an affine transverse foliation. We give an upper bound for the Euler number of the bundle. We also give a new and elementary proof of the following fact: if…
The Bargmann-Wigner formalism is adapted to spherical surfaces embedded in three to eleven dimensions. This is demonstrated to generate wave equations in spherical space for a variety of antisymmetric tensor fields. Some of these equations…
Results from helically symmetric scalar field models and first results from a convergent helically symmetric binary neutron star code are reported here; these are models stationary in the rotating frame of a source with constant angular…
This paper has two parts. We first survey recent efforts on the Bloom conjecture which still remains open in the case of complex dimension at least 4. Bloom's conjecture concerns the equivalence of three regular types. There is a more…
We prove vanishing of distribution on p-adic spherical spaces that are equivariant with respect to a generic character of the nilradical of a Borel subgroup and satisfy a certain condition on the wave-front set. We deduce from this…
We evaluate the partition function of the free and interacting O(N) vector model on a two-parameter family of squashed three spheres in the presence of a scalar deformation. We also find everywhere regular solutions of Einstein gravity…
Non-convex sparse minimization (NSM), or $\ell_0$-constrained minimization of convex loss functions, is an important optimization problem that has many machine learning applications. NSM is generally NP-hard, and so to exactly solve NSM is…
We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…
An algebraic criterion for the vanishing of the beta function for renormalizable quantum field theories is presented. Use is made of the descent equations following from the Wess-Zumino consistency condition. In some cases, these equations…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
We propose a new model-free feature screening method based on energy distances for ultrahigh-dimensional binary classification problems. With a high probability, the proposed method retains only relevant features after discarding all the…
We establish the binary nonlinearization approach of the spectral problem of the super AKNS system, and then use it to obtain the super finite-dimensional integrable Hamiltonian system in supersymmetry manifold $\mathbb{R}^{4N|2N}$. The…
Approximated numerical techniques, for the solution of the elastic wave scattering problem over semi-infinite domains are reviewed. The approximations involve the representation of the half-space by a boundary condition described in terms…
We consider variations of the Rudin-Osher-Fatemi functional which are particularly well-suited to denoising and deblurring of 2D bar codes. These functionals consist of an anisotropic total variation favoring rectangles and a fidelity term…
The study of non-linearity (linearity) of Boolean function was initiated by Rothaus in 1976. The classical non-linearity of a Boolean function is the minimum Hamming distance of its truth table to that of affine functions. In this note we…
Wannier functions provide a localized representation of spectral subspaces of periodic Hamiltonians, and play an important role for interpreting and accelerating Hartree-Fock and Kohn-Sham density functional theory calculations in quantum…
We investigate the performance of a simple signed distance function (SDF) based method by direct comparison with standard SVM packages, as well as K-nearest neighbor and RBFN methods. We present experimental results comparing the SDF…
We propose an algorithm using the Gaussian elimination method to find the minimal Hamming distance and decode received messages of linear codes. This algorithm is easy to implement as it requires no Gr\"obner bases to compute solutions for…
According to the Arnold conjectures and Floer's proofs, there are non-trivial lower bounds for the number of periodic solutions of Hamiltonian differential equations on a closed symplectic manifold whose symplectic form vanishes on spheres.…