English
Related papers

Related papers: Quaternionic Perfect Sequences and Hadamard Matric…

200 papers

In 2019, Perondi and Carmelo determined the set multipartite Ramsey number of particular complete bipartite graphs by establishing a relationship between the set multipartite Ramsey number, Hadamard matrices, and strongly regular graphs,…

Combinatorics · Mathematics 2023-07-20 I Wayan Palton Anuwiksa , Rinovia Simanjuntak , Edy Tri Baskoro

We introduce quaternary Legendre pairs of length $\ell$. In contrast to binary Legendre pairs they can exist for even $\ell$ as well. First we show that they are pertinent to the construction of quaternary Hadamard matrices of order…

Combinatorics · Mathematics 2022-12-22 Ilias S. Kotsireas , Arne Winterhof

To evaluate the Hadamard finite-part integrals accurately, a novel interpolatory-type quadrature is proposed in this article. In our approach, numerical divided difference is utilized to represent the high order derivatives of the…

Numerical Analysis · Mathematics 2022-11-28 Jiajie Yao , Congcong Xie

In this paper, we find regular or biregular Hadamard matrices with maximum excess by negating some rows and columns of known Hadamard matrices obtained from quadratic residues of finite fields. In particular, we show that if either…

Combinatorics · Mathematics 2017-12-27 Mitsugu Hirasaka , Koji Momihara , Sho Suda

A geometrical pattern is a set of points with all pairwise distances (or, more generally, relative distances) specified. Finding matches to such patterns has applications to spatial data in seismic, astronomical, and transportation…

Databases · Computer Science 2017-03-09 Fabio Porto , Amir Khatibi , João R. Nobre , Eduardo Ogasawara , Patrick Valduriez , Dennis Shasha

The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to…

Data Structures and Algorithms · Computer Science 2013-12-03 Krasimir Yordzhev

Our main result is the construction of symmetric Hadamard matrices of order q(1 + q) where q is a prime power congruent to 3 mod 8.

Combinatorics · Mathematics 2025-08-26 Dragomir Ž. Djoković

For a given selection of rows and columns from a Fourier matrix, we give a number of tests for whether the resulting submatrix is Hadamard based on the primitive sets of those rows and columns. In particular, we demonstrate that whether a…

Rings and Algebras · Mathematics 2021-02-03 John E. Herr , Troy M. Wiegand

We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…

Number Theory · Mathematics 2012-05-01 John Voight

We consider a matrix completion problem that exploits social or item similarity graphs as side information. We develop a universal, parameter-free, and computationally efficient algorithm that starts with hierarchical graph clustering and…

Machine Learning · Statistics 2022-01-06 Adel Elmahdy , Junhyung Ahn , Changho Suh , Soheil Mohajer

We say a zero-one matrix $A$ avoids another zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeros. A fundamental problem is to study the extremal function $ex(n,P)$, the maximum number of…

Discrete Mathematics · Computer Science 2017-04-19 P. A. CrowdMath

Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using…

Information Theory · Computer Science 2018-01-23 Danilo Gligoroski , Kristian Gjosteen , Katina Kralevska

We give an algorithm for completing an order-$m$ symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the problem of learning…

Data Structures and Algorithms · Computer Science 2015-11-25 Tselil Schramm , Benjamin Weitz

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

Combinatorics · Mathematics 2012-12-18 Carine Pivoteau , Bruno Salvy , Michele Soria

We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…

Combinatorics · Mathematics 2021-11-30 Michael Anastos

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…

Numerical Analysis · Mathematics 2008-05-21 James Demmel , Ioana Dumitriu , Olga Holtz , Plamen Koev

By generalising the one to one correspondence between exactly solvable hermitian matrices $\mathcal{H}=\mathcal{H}^\dagger$ and exactly solvable spinless fermion systems $\mathcal{H}_f=\sum_{x,y}c_x^\dagger\mathcal{H}(x,y)c_y$, four types…

High Energy Physics - Theory · Physics 2025-04-08 Ryu Sasaki

In this work the investigation of hadronic structures with the help of the harmonic quarks is prolonged. The harmonic quark model is good at describing the meson structures and the baryon excitations to resonances, in particular…

High Energy Physics - Phenomenology · Physics 2007-05-23 Oleg A. Teplov

We construct a skew-Hadamard matrix of order 1252 = 2(5^4 + 1) using a bordered skew-Hadamard difference family over GF(5^4), with blocks given as unions of cyclotomic classes of order N = 16. This order has been reported as missing in some…

Combinatorics · Mathematics 2026-02-19 Amira Karoui

We consider the problem of selecting sequentially a unimodal subsequence from a sequence of independent identically distributed random variables, and we find that a person doing optimal sequential selection does within a factor of the…

Probability · Mathematics 2011-10-31 Alessandro Arlotto , J. Michael Steele
‹ Prev 1 8 9 10 Next ›