English
Related papers

Related papers: Vanishing ideals of binary Hamming spheres

200 papers

We prove the vanishing of bounded cohomology with separable dual coefficients for many groups of interest in geometry, dynamics, and algebra. These include compactly supported structure-preserving diffeomorphism groups of certain manifolds;…

Group Theory · Mathematics 2025-10-30 Caterina Campagnolo , Francesco Fournier-Facio , Yash Lodha , Marco Moraschini

A special class of integrable nonlinear differential equations related to A.III-type symmetric spaces and having additional reductions are analyzed via the inverse scattering method (ISM). Using the dressing method we construct two classes…

Exactly Solvable and Integrable Systems · Physics 2011-10-21 Vladimir S. Gerdjikov , Georgi G. Grahovski , Alexander V. Mikhailov , Tihomir I. Valchev

Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…

Information Theory · Computer Science 2020-07-24 Elias Javier Garcia Claro , Horacio Tapia Recillas

In this paper we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K.

Commutative Algebra · Mathematics 2015-04-28 Azucena Tochimani , Rafael H. Villarreal

The vanishing ideal is a set of polynomials that takes zero value on the given data points. Originally proposed in computer algebra, the vanishing ideal has been recently exploited for extracting the nonlinear structures of data in many…

Machine Learning · Statistics 2018-01-30 Hiroshi Kera , Yoshihiko Hasegawa

We prove the classical Nakano vanishing theorem with H\"ormander $L^2$-estimates on a compact K\"ahler manifold using Siu's so called $\partial\dbar$-Bochner-Kodaira method, thereby avoiding the K\"ahler identities completely. We then…

Complex Variables · Mathematics 2012-12-19 Hossein Raufi

In this paper, we propose a novel bounded asymmetric elastic net ($L_{baen}$) loss function and combine it with the support vector machine (SVM), resulting in the BAEN-SVM. The $L_{baen}$ is bounded and asymmetric and can degrade to the…

Machine Learning · Statistics 2026-04-09 Haiyan Du , Hu Yang

It is a classical theorem of Sarason that an analytic function of bounded mean oscillation ($BMOA$), is of vanishing mean oscillation if and only if its rotations converge in norm to the original function as the angle of the rotation tends…

Complex Variables · Mathematics 2023-07-24 Nikolaos Chalmoukis , Vassilis Daskalogiannis

Binary codes have been widely used in vision problems as a compact feature representation to achieve both space and time advantages. Various methods have been proposed to learn data-dependent hash functions which map a feature vector to a…

Computer Vision and Pattern Recognition · Computer Science 2014-10-22 Jie Feng , Wei Liu , Yan Wang

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Algebraic Geometry · Mathematics 2012-11-22 Robert Krone

Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…

Commutative Algebra · Mathematics 2019-10-23 Manuel Gonzalez-Sarabia , Jose Martínez-Bernal , Rafael H. Villarreal , Carlos E. Vivares

We present a powerful new loss function and training scheme for learning binary hash codes with any differentiable model and similarity function. Our loss function improves over prior methods by using log likelihood loss on top of an…

Machine Learning · Computer Science 2018-10-03 Martin Loncaric , Bowei Liu , Ryan Weber

We propose fast, exact and efficient algorithms for the convolution of two arbitrary functions on the sphere which speed up computations by a factor \order{\sqrt{N}} compared to present methods where $N$ is the number of pixels. No…

Astrophysics · Physics 2009-10-31 Benjamin D. Wandelt , Krzysztof M. Gorski

Given scheme-theoretic equations for a nonsingular subvariety, we prove that the higher cohomology groups for suitable twists of the corresponding ideal sheaf vanish. From this result, we obtain linear bounds on the multigraded…

Algebraic Geometry · Mathematics 2012-08-03 Victor Lozovanu , Gregory G. Smith

In earlier papers [3,4,5,6] Gursey et al. showed development of a bilocal baryon-meson field from two quark-antiquark fields. The Hamiltonian in the case of vanishing quark masses was shown to have a very good agreement with experiments…

Mathematical Physics · Physics 2014-11-07 Yoon Seok Choun

We discuss some geometrical issues related to spacelike minimal surfaces in $AdS_m$ with null polygonal boundaries at conformal infinity. In particular for $AdS_4$, two holomorphic input functions for the Pohlmeyer reduced system are…

High Energy Physics - Theory · Physics 2010-02-11 Harald Dorn

We study the vanishing sets of slice regular polynomials in several quaternionic variables. We obtain a geometric description of the vanishing sets in two variables, which leads to a new version of the Strong Hilbert Nullstellensatz in the…

Complex Variables · Mathematics 2023-11-10 Anna Gori , Giulia Sarfatti , Fabio Vlacci

We consider the bosonic Fock space over the Hilbert space of transversal vector fields in three dimensions. This space carries a canonical representation of the group of rotations. For a certain class of operators in Fock space we show that…

Mathematical Physics · Physics 2015-05-28 David Hasler , Ira Herbst

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of $\mathds{1}_{\{p\leq0\}}$ to the image plane, where $\mathds{1}$ denotes the indicator function…

Computational Geometry · Computer Science 2016-11-03 Mitra Fatemi , Arash Amini , Martin Vetterli

We consider redundant binary joint digital expansions of integer vectors. The redundancy is used to minimize the Hamming weight, i.e., the number of nonzero digit vectors. This leads to efficient linear combination algorithms in abelian…

Number Theory · Mathematics 2019-02-20 Clemens Heuberger , Sara Kropf