English
Related papers

Related papers: The cohomological reduction method for computing n…

200 papers

Nonlinear dimensionality reduction methods have demonstrated top-notch performance in many pattern recognition and image classification tasks. Despite their popularity, they suffer from highly expensive time and memory requirements, which…

Computational Geometry · Computer Science 2014-04-08 Amir Najafi , Amir Joudaki , Emad Fatemizadeh

Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full…

Combinatorics · Mathematics 2019-06-17 José Andrés Armario , Ivan Bailera , Ronan Egan

We show by a direct computation that, for any Hopf algebra with a modulus-like character, the formulas first introduced in [CM] in the context of characteristic classes for actions of Hopf algebras, do define a cyclic module. This provides…

Quantum Algebra · Mathematics 2007-05-23 Alain Connes , Henri Moscovici

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…

Combinatorics · Mathematics 2024-02-21 Stefan Steinerberger

In a previous paper, the author compute the dimension of Hochschild cohomology groups of Jacobian algebras from (unpunctured) triangulated surfaces, and gave a geometric interpretation of those numbers in terms of the number of internal…

Representation Theory · Mathematics 2016-10-12 Yadira Valdivieso-Díaz

This monograph presents a detailed analysis of hypercomplex numbers in 2, 3 and 4 dimensions, then presents the properties of hypercomplex numbers in 5 and 6 dimensions. It continues with a detailed analysis of hypercomplex numbers in n…

Complex Variables · Mathematics 2007-05-23 Silviu Olariu

A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…

Symbolic Computation · Computer Science 2015-08-28 Katsusuke Nabeshima , Shinichi Tajima

A new method for solving systems of linear algebraic equations of a special type arising in solving problems of image reconstruction has been proposed. This method, due to a certain symmetry of the matrix and the choice of the voxel…

Numerical Analysis · Mathematics 2019-08-30 A. A. Alikhanov , A. M. Apekov , Z. A. Kokov , A. O. Belyaev , L. A. Khamukova

For an integer n>2 we define a polylogarithm, which is a holomorphic function on the universal abelian cover of C-{0,1} defined modulo (2 pi i)^n/(n-1)!. We use the formal properties of its functional relations to define groups lifting…

K-Theory and Homology · Mathematics 2023-03-29 Christian K. Zickert

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Representation Theory · Mathematics 2025-07-08 Dmitry Fuchs , Alexandre Kirillov

We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square $\{\pm 1\}$-matrices of size congruent to $2$ modulo $4$. Quasi-orthogonal cocycles are analogous to the orthogonal…

Combinatorics · Mathematics 2019-08-27 J. A. Armario , D. L. Flannery

An entirely quantum mechanical approach to diagonalize hermitean matrices has been presented recently. Here, the genuinely quantum mechanical approach is considered in detail for (2x2) matrices. The method is based on the measurement of…

Quantum Physics · Physics 2015-06-26 Stefan Weigert

We study universal cycles on the Grassmannian $G_q(2,n)$, the set of $2$-dimensional $\mathbb{F}_q$-subspaces of $\mathbb{F}_q^n$. While their existence is known from inductive and Eulerian graph methods, we give a direct algebraic…

Combinatorics · Mathematics 2025-10-16 Chen Yu Chi , Ming Hsuan Kang , Yu Hsuan Hsieh

For $n$ a power of two, we give a complete description of the cohomology algebra $H^*(\widetilde G_{n,3};\mathbb Z_2)$ of the Grassmann manifold $\widetilde G_{n,3}$ of oriented $3$-planes in $\mathbb R^n$. We do this by finding a reduced…

Algebraic Topology · Mathematics 2023-06-12 Uroš A. Colović , Branislav I. Prvulović

We propose a method for computing the cohomology ring of three--dimensional (3D) digital binary-valued pictures. We obtain the cohomology ring of a 3D digital binary--valued picture $I$, via a simplicial complex K(I)topologically…

Computer Vision and Pattern Recognition · Computer Science 2011-05-24 Rocio Gonzalez-Diaz , Pedro Real

Two graphs $G$ and $H$ are \emph{cospectral} if the adjacency matrices share the same spectrum. Constructing cospectral non-isomorphic graphs has been studied extensively for many years and various constructions are known in the literature,…

Combinatorics · Mathematics 2024-09-17 Lihuan Mao , Fu Yan

Cohomology and cohomology ring of three-dimensional (3D) objects are topological invariants that characterize holes and their relations. Cohomology ring has been traditionally computed on simplicial complexes. Nevertheless, cubical…

Computer Vision and Pattern Recognition · Computer Science 2011-05-24 Rocio Gonzalez-Diaz , Maria Jose Jimenez , Belen Medrano

We calculate the rational cohomology of the classifying space of the diffeomorphism group of the manifolds $U_{g,1}^n:= \#^g(S^n \times S^{n+1})\setminus \mathrm{int}{D^{2n+1}}$, for large $g$ and $n$, up to approximately degree $n$. The…

Algebraic Topology · Mathematics 2024-02-21 Johannes Ebert , Jens Reinhold

We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…

Quantum Algebra · Mathematics 2013-11-01 Yi-Zhi Huang

The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…

Combinatorics · Mathematics 2024-09-19 Sergey Kurapov , Maxim Davidovsky , Svetlana Polyuga