English
Related papers

Related papers: Some new near-normal sequences

200 papers

In 2012 B\'ona showed the rather surprising fact that the cumulative number of occurrences of the classical patterns $231$ and $213$ are the same on the set of permutations avoiding $132$, beside the pattern based statistics $231$ and $213$…

Combinatorics · Mathematics 2014-12-12 Vincent Vajnovszki

In our previous work, we introduced the following relaxation of the Hadamard property: a square matrix $H\in M_N(\mathbb R)$ is called "almost Hadamard" if $U=H/\sqrt{N}$ is orthogonal, and locally maximizes the 1-norm on O(N). We review…

Combinatorics · Mathematics 2013-09-17 Teodor Banica , Ion Nechita

The differences between the $N=0$ and $N=1$ standard models are emphasized in formulating their short distance extension. We sketch methods to reproduce many of the small numbers in the model in terms of scale ratios, applying see-saw like…

High Energy Physics - Phenomenology · Physics 2016-09-01 P. Ramond

Let $K$ be a field and $X$, $Y$ denote matrices such that, the entries of $X$ are either indeterminates over $K$ or $0$ and the entries of $Y$ are indeterminates over $K$ which are different from those appearing in $X$. We consider ideals…

Commutative Algebra · Mathematics 2020-04-07 Joydip Saha , Indranath Sengupta , Gurab Tripathi

We construct a set $H$ of orthogonal polynomial sequences that contains all the families in the Askey scheme and the $q$-Askey scheme. The polynomial sequences in $H$ are solutions of a generalized first-order difference equation which is…

Classical Analysis and ODEs · Mathematics 2021-06-29 Luis Verde-Star

We classify four-dimensional $\mathcal{N}=1$ supersymmetric gauge theories with a simple gauge group admitting a large $N$ limit that flow to non-trivial superconformal fixed points in the infrared. We focus on the cases where the large $N$…

High Energy Physics - Theory · Physics 2025-10-23 Minseok Cho , Ki-Hong Lee , Jaewon Song

For nonnegative integers $n$ and $k$, we introduce in this paper a new class of $(n,k)$-quasi-*-paranormal operators satisfying $$||T^{1+n}(T^{k}x)||^{1/(1+n)}||T^{k}x||^{n/(1+n)} \geq ||T^*(T^{k}x)|| \makebox{\ for all} x \in H.$$ This…

Functional Analysis · Mathematics 2014-08-26 Qingping Zeng , Huaijie Zhong

In this paper we use a design theoretical approach to construct new, previously unknown complex Hadamard matrices. Our methods generalize and extend the earlier results of de la Harpe--Jones and Munemasa--Watatani and offer a theoretical…

Combinatorics · Mathematics 2010-02-09 Ferenc Szöllősi

An explicit construction of infinite sequences of strongly regular digraphs with parameter sets $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$ is described. A computer program was used to find the initial digraphs. The remaining…

Combinatorics · Mathematics 2025-10-01 Viktor A. Byzov , Igor A. Pushkarev

The p-adic cellular neural networks (CNNs) are mathematical generalizations of the neural networks introduced by Chua and Yang in the 80s. In this work we present two new types of CNNs that can perform computations with real data, and whose…

Cellular Automata and Lattice Gases · Physics 2023-02-22 B. A. Zambrano-Luna , W. A. Zúñiga-Galindo

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \leq d \leq 12$…

Combinatorics · Mathematics 2025-06-05 Nino Bašić , Ivan Damnjanović , Patrick W. Fowler

We obtain new non-existence results of perfect p-ary sequences with period n (called type $[p, n]$). The first case is a class with type [p\equiv5\pmod 8,p^aqn']. The second case contains five types [p\equiv3\pmod 4,p^aq^ln'] for certain…

Information Theory · Computer Science 2019-12-18 Chang Lv

From the viewpoint of higher dimensional Auslander-Reiten theory, we introduce a new class of finite dimensional algebras of global dimension n, which we call n-representation infinite. They are a certain analog of representation infinite…

Representation Theory · Mathematics 2012-05-08 Martin Herschend , Osamu Iyama , Steffen Oppermann

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…

Information Theory · Computer Science 2017-03-21 Yuhua Sun , Qiang Wang , Tongjiang Yan

We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…

Quantum Physics · Physics 2007-05-23 David Emms , Edwin R. Hancock , Simone Severini , Richard C. Wilson

Let $R$ be a local principal ideal ring of length two, for example, the ring $R=\Z/p^2\Z$ with $p$ prime. In this paper we develop a theory of normal forms for similarity classes in the matrix rings $M_n(R)$ by interpreting them in terms of…

Rings and Algebras · Mathematics 2015-05-01 Amritanshu Prasad , Pooja Singla , Steven Spallone

We introduce Hadamard matrices whose entries are quaternionic. We then go on to provide classification of quaternionic Hadamard matrices of circulant core of orders 2 through 5. We also introduce quaternionic Hadamard matrices of Butson…

Combinatorics · Mathematics 2022-03-08 Logan M. Higginbotham , Chase T. Worley

Let $N$ be a positive integer. For any positive integer $L\leq N$ and any positive divisor $r$ of $N$, we enumerate the equivalence classes of dessins d'enfants with $N$ edges, $L$ faces and two vertices whose automorphism groups are cyclic…

Number Theory · Mathematics 2022-09-19 Madoka Horie

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

Combinatorics · Mathematics 2026-03-20 Abbas Alhakim , Chris J. Mitchell , Janusz Szmidt , Peter R. Wild

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…

Combinatorics · Mathematics 2007-05-23 Anders Claesson , Toufik Mansour