Related papers: Vanishing ideals of binary Hamming spheres
Atomic norm minimization (ANM) is a key approach for line spectral estimation (LSE). Most related algorithms formulate ANM as a semidefinite programming (SDP), which incurs high computational cost. In this letter, we revisit the ANM problem…
On a smooth bounded Euclidean domain, Sobolev-subcritical fast diffusion with vanishing boundary trace is known to lead to finite-time extinction, with a vanishing profile selected by the initial datum. In rescaled variables, we quantify…
We propose a fast, distance-preserving, binary embedding algorithm to transform a high-dimensional dataset $\mathcal{T}\subseteq\mathbb{R}^n$ into binary sequences in the cube $\{\pm 1\}^m$. When $\mathcal{T}$ consists of well-spread (i.e.,…
In earlier works on Shape Dynamics (SD), a linear method of solving a particular set of Lichnerowicz-type equations through the implicit function theorem was developed in order to implicitly construct SD's global Hamiltonian and eliminate…
In this paper, we address a way to reduce the total computational cost of meshless approximation by reducing the required stencil size through spatially varying computational node regularity. Rather than covering the entire domain with…
Let $O_X$ (resp. $D_X$) be the sheaf of holomorphic functions (resp. the sheaf of linear differential operators with holomorphic coefficients) on $X$ (=the complex affine n-space). Let $Y$ be a locally weakly quasi-homogeneous free divisor…
Minimum achievable complexity (MAC) for a maximum likelihood (ML) performance-achieving detection algorithm is derived. Using the derived MAC, we prove that the conventional sphere decoding (SD) algorithms suffer from an inherent weakness…
Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by…
For the super AKNS system, an implicit symmetry constraint between the potentials and the eigenfunctions is proposed. After introducing some new variables to explicitly express potentials, the super AKNS system is decomposed into two…
An approximation scheme for model disordered solids is proposed that leads to the fully analytical evaluation of the elastic constants under explicit account of the inhomogeneity (nonaffinity) of the atomic displacements. The theory is in…
We study the occurrence of spontaneous symmetry breaking (SSB) for O(N) models using functional renormalization group techniques. We show that even the local potential approximation (LPA) when treated exactly is sufficient to give…
We introduce a fragment of second-order unification, referred to as \emph{Second-Order Ground Unification (SOGU)}, with the following properties: (i) only one second-order variable is allowed, and (ii) first-order variables do not occur. We…
We show how decimated Gibbs measures which have an unbroken continuous symmetry due to the Mermin-Wagner theorem, although their discrete equivalents have a phase transition, still can become non-Gibbsian. The mechanism rests on the…
In this paper, we apply two-to-one functions over $\mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $\left(x^{2^t}+x\right)^e$…
Binary codes can be used to speed up nearest neighbor search tasks in large scale data sets as they are efficient for both storage and retrieval. In this paper, we propose a robust auto-encoder model that preserves the geometric…
We discuss methods for modeling eclipsing binary stars using the "physical", "simplified" and "phenomenological" models. There are few realizations of the "physical" Wilson-Devinney (1971) code and its improvements, e.g. Binary Maker,…
In a real Hilbert space $\mathcal{H}$. Given any function $f$ convex differentiable whose solution set $\argmin_{\mathcal{H}}\,f$ is nonempty, by considering the Proximal Algorithm $x_{k+1}=\text{prox}_{\b_k f}(d x_k)$, where $0<d<1$ and…
The binary sum-of-digits function $\mathsf{s}$ returns the number of ones in the binary expansion of a nonnegative integer. Cusick's Hamming weight conjecture states that, for all integers $t\geq 0$, the set of nonnegative integers $n$ such…
Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…
Let X* be a subset of an affine space A^s, over a finite field K, which is parameterized by the edges of a clutter. Let X and Y be the images of X* under the maps x --> [x] and x --> [(x,1)] respectively, where [x] and [(x,1)] are points in…