Author profile: Armario Sampalo, José Andrés
Institutional data
Name | Armario Sampalo, José Andrés |
Department | Matemática Aplicada I |
Knowledge area | Matemática Aplicada |
Professional category | Profesor Titular de Universidad |
Request | |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Statistics
-
No. publications
56
-
No. visits
4107
-
No. downloads
4959
Publications |
---|
Article
![]() Generalized partially bent functions, generalized perfect arrays, and cocyclic Butson matrices
(Springer, 2023)
In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard ... |
Article
![]() A computational approach to analyze the Hadamard quasigroup product
(American Institute of Mathematical Sciences (AIMS), 2023)
Based on the binary product described by any Latin square, the Hadamard quasigroup product is introduced in this paper as ... |
Article
![]() Boolean Functions and Permanents of Sylvester Hadamard Matrices
(MDPI, 2021)
One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this ... |
Article
![]() Generalized Hadamard full propelinear codes
(Springer, 2021)
Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized ... |
Article
![]() Hadamard Matrices with Cocyclic Core
(MDPI, 2021)
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself ... |
Article
![]() On Cocyclic Hadamard Matrices over Goethals-Seidel Loops
(MDPI, 2020)
About twenty-five years ago, Horadam and de Launey introduced the cocyclic development of designs, from which the notion ... |
Article
![]() Quasi-orthogonal cocycles, optimal sequences and a conjecture of Littlewood
(Springer, 2020)
A quasi-orthogonal cocycle, defined over a group of order congruent to 2 modulo 4, is naturally analogous to an orthogonal ... |
Article
![]() Butson full propelinear codes
(Cornell University, 2020)
In this paper we study Butson Hadamard matrices, and codes over finite rings coming from these matrices in logarithmic ... |
Article
![]() Almost supplementary difference sets and quaternary sequences with optimal autocorrelation
(Springer, 2020)
We introduce almost supplementary difference sets (ASDS). For odd m, certain ASDS in Zm that have amicable incidence ... |
Article
![]() Generating binary partial Hadamard matrices
(Elsevier, 2019)
This paper deals with partial binary Hadamard matrices. Although there is a fast simple way to generate about a half (which ... |
Article
![]() Generalized binary arrays from quasi-orthogonal cocycles
(Springer, 2019)
Generalized perfect binary arrays (GPBAs) were used by Jedwab to construct perfect binary arrays. A non-trivial GPBA can ... |
Article
![]() A Mixed Heuristic for Generating Cocyclic Hadamard Matrices
(Springer, 2018)
A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion ... |
Article
![]() Gröbner bases and cocyclic Hadamard matrices
(Elsevier, 2018)
Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are uniquely related ... |
Article
![]() GA Based Robust Blind Digital Watermarking
(Elsevier, 2018)
A genetic algorithm based robust blind digital watermarking scheme is presented. The experimental results show that our ... |
Article
![]() Quasi-Hadamard Full Propelinear Codes
(Springer, 2018)
In this paper, we give a characterization of quasi-Hadamard groups in terms of propelinear codes. We define a new class ... |
Presentation |
Presentation
![]() Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
(2017)
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard ... |
Presentation
![]() (Pseudo)-cocyclic (structured) Hadamard matrices over (quasi)groups
(2017)
Progressing on a survey of the state of the art of cocyclic constructions for Hadamard matrices, we will prove that the ... |
Article
![]() On the Smith normal form of skew E-W matrices
(Taylor and Francis, 2017)
|
Article
![]() On quasi-orthogonal cocycles
(Wiley, 2017)
We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for ... |
Article
![]() On D4t-Cocyclic Hadamard Matrices
(Wiley, 2016)
In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yield a cocyclic Hadamard ... |
Article
![]() On Skew E–W Matrices
(Wiley, 2016)
An E–W matrix M is a ( − 1, 1)-matrix of order urn:x-wiley:10638539:media:jcd21519:jcd21519-math-0001, where t is a positive ... |
Article
![]() Determinants of (–1,1)-matrices of the skew-symmetric type: a cocyclic approach
(Walter de Gruyter GmbH, 2015)
An n by n skew-symmetric type (−1, 1)-matrix K = [ki,j ] has 1’s on the main diagonal and ±1’s elsewhere with ki,j = −kj,i. ... |
Article
![]() On higher dimensional cocyclic Hadamard matrices
(2015)
Provided that a cohomological model for G is known, we describe a method for constructing a basis for n-cocycles over G, ... |
Presentation
![]() On (−1, 1)-Matrices of Skew Type with the Maximal Determinant and Tournaments
(Springer, 2014)
Skew Hadamard matrices of order n give the solution to the question of finding the largest possible n by n determinant ... |
Article
![]() On permanents of Sylvester Hadamard matrices
(Cornell University, 2013)
It is well-known that the evaluation of the permanent of an arbitrary (−1, 1)- matrix is a formidable problem. Ryser’s ... |
Article
![]() Self-Dual codes from (−1,1)-matrices of skew symmetric type
(Cornell University, 2013)
Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew ... |
Presentation
![]() Project Estimation with NDT
(ScitePress Digital Library, 2012)
Software Project Estimation is one of the most critical and complex task for a Project manager. Several techniques, tools ... |
Article
![]() Embedding cocylic D-optimal designs in cocylic Hadamard matrices
(International Linear Algebra Society, 2012)
A method for embedding cocyclic submatrices with “large” determinants of orders 2t in certain cocyclic Hadamard matrices ... |
Article
![]() Homological models for semidirect products of finitely generated Abelian groups
(2012)
Let G be a semidirect product of finitely generated Abelian groups. We provide a method for constructing an explicit ... |
Article
![]() The maximal determinant of cocyclic (−1, 1)-matrices over D2t
(Elsevier, 2012)
Cocyclic construction has been successfully used for Hadamard matrices of order n. These -matrices satisfy that and give ... |
Article
![]() On an inequivalence criterion for cocyclic Hadamard matrices
(Springer, 2010)
Given two Hadamard matrices of the same order, it can be quite difficult to decide whether or not they are equivalent. ... |
Article
![]() Cartan's contructions and the twisted Eilenberg-Zilber theorem
(De Gruyter, 2010)
|
Presentation
![]() Searching for partial Hadamard matrices
(Universidade de Santiago de Compostela, Servicio de Publicaciones, 2010)
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” means that hopefully ... |
Presentation
![]() ACS Searching for D4t-Hadamard Matrices
(Springer, 2010)
An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D4t is described. The underlying ... |
Article
![]() Algebra Structures on the Comparison of the Reduced Bar Construction and the Reduced W-Construction
(Taylor and Francis, 2009)
For a simplicial augmented algebra K, Eilenberg–Mac Lane constructed a chain map . They proved that g is a reduction ... |
Article
![]() The homological reduction method for computing cocyclic Hadamard matrices
(2009)
An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is described. Provided that a ... |
Presentation
![]() Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
(Springer, 2009)
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in ... |
Article
![]() A System of Equations for Describing Cocyclic Hadamard Matrices
(Wiley, 2008)
Given a basis equation image for 2-cocycles equation image over a group G of order equation image, we describe a nonlinear ... |
Presentation
![]() Error correcting codes from quasi-Hadamard matrices
(Springer, 2007)
Levenshtein described in [5] a method for constructing error correcting codes which meet the Plotkin bounds, provided ... |
Article
![]() Algebra Structures on the Twisted Eilenberg–Zilber Theorem
(Taylor and Francis, 2007)
Let G, G′, and G ×τ G′ be three simplicial groups (not necessarily abelian) and C N (G) ⊗ t C N (G′) be the “twisted” ... |
Chapter of Book
![]() A Mathematica Notebook for Computing the Homology of Iterated Products of Groups
(2006)
Let G be a group which admits the structure of an iterated product of central extensions and semidirect products of abelian ... |
Chapter of Book
![]() Calculating cocyclic hadamard matrices in Mathematica: exhaustive and heuristic searches
(2006)
We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = ... |
Chapter of Book
![]() A genetic algorithm for cocyclic hadamard matrices
(2006)
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case of dihedral groups, ... |
Chapter of Book
![]() Comparison maps for relatively free resolutions
(2006)
Let Λ be a commutative ring, A an augmented differential graded algebra over Λ (briefly, DGA-algebra) and X be a relatively ... |
Article |
Presentation
![]() Matrices cocíclicas de Hadamard sobre productos semidirectos
(Alberto Márquez, 2002)
|
Article
![]() Algorithms in Algebraic Topology and Homological Algebra: Problem of Complexity
(Springer, 2002)
This review tackles the problem of the high computational complexity lying in most algorithms in algebraic topology and ... |
Presentation
![]() El Proyecto CHATA
(Universidad de Sevilla, 2001)
En este art´ıculo, se pretende dar una visi´on general y lo m´as divulgativa posible sobre los prop´ositos y objetivos del ... |
Chapter of Book
![]() An algorithm for computing cocyclic matrices developed over some semidirect products
(2001)
An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product offinite abelian groups ... |
Presentation
![]() Computing “Small” 1–Homological Models for Commutative Differential Graded Algebras
(Springer, 2000)
We use homological perturbation machinery specific for the algebra category [13] to give an algorithm for computing the ... |
Article
![]() On p-minimal homological models of twisted tensor products of elementary complexes localised over a prime
(American Mathematical Society, 1999)
In this paper, working over Z(p) and using algebra perturbation results from [18], p-minimal homological models of twisted ... |
Presentation
![]() An algorithm for computing the first homology groups of CDGAs with linear differential
(Research Institute for Symbolic Computation, 1999)
We design here a primary platform for computing the basic homological information of Commutative Differential Graded ... |
PhD Thesis
![]() Estructuras multiplicativas y homología de fibrados
(1999)
Como es bien conocido, los principales mecanismos algebraicos para obtener información homológica de los espacios fibrados ... |
Presentation
![]() On the computability of the p-local homology of twisted cartesian products of Eilenberg-Mac Lane spaces
(Universidade do Minho, 1997)
Working in the framework of the Simplicial Topology, a method for calculating the p-local homology of a twisted cartesian ... |
Presentation
![]() Homological perturbation theory and computability of Hochschild and cyclic homologies of CDGAs
(Diffiety Institute of the Russian Academy of Natural Sciences, 1997)
We establish an algorithm computing the homology of commutative differential graded algebras (briefly, CDGAs). The main ... |