English
Related papers

Related papers: Some new near-normal sequences

200 papers

A canonical Huffman sequence is characterized by a zero inner-product between itself and each of its shifted copies, except at their largest relative shifts: their aperiodic auto-correlation then becomes delta-like, a single central peak…

Combinatorics · Mathematics 2021-06-07 T. C. Petersen , D. M. Paganin , I. D. Svalbe

We investigate the class of completely regular codes in graphs with a distance partition C_0,..., C_\rho, where each set C_i, for 0<=i<=r-1, is an independent set. This work focuses on the existence problem for such codes in the…

Combinatorics · Mathematics 2025-05-16 I. Yu. Mogilnykh , A. Yu. Vasil'eva

Given a real symmetric $n\times n$ matrix, the sepr-sequence $t_1\cdots t_n$ records information about the existence of principal minors of each order that are positive, negative, or zero. This paper extends the notion of the sepr-sequence…

Combinatorics · Mathematics 2018-07-16 Leslie Hogben , Jephian C. -H. Lin , D. D. Olesky , P. van den Driessche

In the past few years, convolutional neural nets (CNN) have shown incredible promise for learning visual representations. In this paper, we use CNNs for the task of predicting surface normals from a single image. But what is the right…

Computer Vision and Pattern Recognition · Computer Science 2014-11-19 Xiaolong Wang , David F. Fouhey , Abhinav Gupta

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

The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2.…

Rings and Algebras · Mathematics 2007-05-23 Francesca Benanti , Vesselin Drensky

Strongly regular graphs are highly symmetrical and can be described fully with just a few parameters, yet the existence of many of them is still under the question. In this paper, we continue the study of the famuly of strongly regular…

Combinatorics · Mathematics 2025-11-11 Reimbay Reimbayev

The ground states of the Bernasconi model are binary +1/-1 sequences of length N with low autocorrelations. We introduce the notion of perfect sequences, binary sequences with one-valued off-peak correlations of minimum amount. If they…

Disordered Systems and Neural Networks · Physics 2009-10-30 Stephan Mertens , Christine Bessenrodt

We provide a simple criterion for an element of the mapping class group of a closed surface to have normal closure equal to the whole mapping class group. We apply this to show that every nontrivial periodic mapping class that is not a…

Geometric Topology · Mathematics 2020-06-03 Justin Lanier , Dan Margalit

If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of…

Information Theory · Computer Science 2008-05-10 Denis Krotov

The matrix $S = [1+x_i y_j]_{i,j=1}^{n}, 0<x_1<\cdots<x_n,\, 0<y_1<\cdots<y_n$, has gained importance lately due to its role in powers preserving total nonnegativity. We give an explicit decomposition of $S$ in terms of elementary…

Rings and Algebras · Mathematics 2022-06-03 Priyanka Grover , Veer Singh Panwar

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

Formal Languages and Automata Theory · Computer Science 2026-04-28 Marius Bozga , Radu Iosif , Florian Zuleger

In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…

Functional Analysis · Mathematics 2011-04-19 Ferenc Szöllősi

Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…

Information Theory · Computer Science 2017-05-17 W Su , Y Yang , Z Zhou , X Tang

In this work it is shown that certain interesting types of quasi-orthogonal system of subalgebras (whose existence cannot be ruled out by the trivial necessary conditions) cannot exist. In particular, it is proved that there is no…

Mathematical Physics · Physics 2010-02-02 Mihály Weiner

The author has recently introduced the class of CNED sets in Euclidean space, generalizing the classical notion of NED sets, and shown that they are quasiconformally removable. A set $E$ is CNED if the conformal modulus of a curve family is…

Complex Variables · Mathematics 2025-02-17 Dimitrios Ntalampekos

Every Hadamard matrix $H$ of order $n > 1$ induces a graph with $4n$ vertices, called the Hadamard graph $\Gamma(H)$ of $H$. Since $\Gamma(H)$ is a distance-regular graph with diameter $4$, it induces a $4$-class association scheme…

Combinatorics · Mathematics 2015-03-10 Mitsugu Hirasaka , Kijung Kim , Hyonju Yu

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

First we define a new kind of function over $\mathbb{N}$. For each $i\in\mathbb{N}$ we have an associated function, which will be called $S_i$ . Then we define a new kind of sequence, to be made from the functions $S_i$ . Finally, we will…

General Mathematics · Mathematics 2016-07-22 Felipe Bottega Diniz

We prove that a nonsymmetric normal entry pattern of order $n$ ($n\ge 3$) has at most $n(n-3)/2+3$ distinct indeterminates and up to permutation similarity this number is attained by a unique pattern which is explicitly described.

Combinatorics · Mathematics 2015-06-12 Zejun Huang , Xingzhi Zhan
‹ Prev 1 8 9 10 Next ›