Related papers: Balanced Weighing Matrices

For $k=1,2,\ldots$ let $H_k$ denote the harmonic number $\sum_{j=1}^k 1/j$. In this paper we establish some new congruences involving harmonic numbers. For example, we show that for any prime $p>3$ we have…

An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

As the classical $(p,q)$-Poincar\'e inequality is known to fail for $0 < p < 1$, we introduce the notion of weighted multilinear Poincar\'e inequality as a natural alternative when $m$-fold products and $1/m < p$ are considered. We prove…

We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…

We derive the structural relations between nested harmonic sums and the corresponding Mellin transforms of Nielsen integrals and harmonic polylogarithms at weight {\sf w = 6}. They emerge in the calculations of massless single--scale…

For the algebraic group $SL_{l+1}(\mathbb{C})$ we describe a system of positive roots associated to conjugacy classes in its Weyl group. Using this we explicitly describe the algebra of regular functions on certain transverse slices to…

We study a W-algebra of central charge 2(k-1)/(k+2) with k a positive integer greater than 1

A fundamental task in the analysis of datasets with many variables is screening for associations. This can be cast as a multiple testing task, where the objective is achieving high detection power while controlling type I error. We consider…

We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…

Let $p$ be a prime, and let $k,n,m,n_0$ and $m_0$ be nonnegative integers such that $k\ge 1$, and $_0$ and $m_0$ are both less than $p$. K. Davis and W. Webb established that for a prime $p\ge 5$ the following variation of Lucas' Theorem…

Let $p$ be prime, $N$ be a positive integer prime to $p$, and $k$ be an integer. Let $P_k(t)$ be the characteristic series for Atkin's $U$ operator as an endomorphism of $p$-adic overconvergent modular forms of tame level $N$ and weight…

In this note we prove that {equation*} {np^s\choose mp^s+r}\equiv (-1)^{r-1}r^{-1}(m+1){n\choose m+1}p^s \pmod{p^{s+1}} {equation*} where $p$ is any prime, $n$, $m$, $s$ and $r$ are nonnegative integers such that $n\ge m$, $s\ge 1$, $1\le…

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

We introduce some (p,q)-deformations of the weight multiplicities for the representations of any simple Lie algebra g over the complex numbers. This is done by associating the indeterminate q to the positive roots of a parabolic subsystem…

For all positive powers of primes $p\geq 5$, we prove the existence of infinitely many linear congruences between the exponents of twisted Borcherds products arising from a suitable scalar-valued weight $1/2$ weakly holomorphic modular form…

This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from $n\cdot (n-1)$ to $n-1$. An algorithm of reconstructing of the PC matrix from its set of…

Computing $p \rightarrow q$ norm for matrices is a classical problem in computational mathematics and power iteration is a well-known method for computing $p \rightarrow q $ norm for a matrix with nonnegative entries. Here we define an…

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…