English
Related papers

Related papers: 3-enumerated alternating sign matrices

200 papers

Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…

Information Theory · Computer Science 2024-10-04 Xiumei Li , Zongxi Chen , Fei Li

In this paper, we give a representation of the average of complete joint weight enumerators of two linear codes of length $n$ over $\mathbb{F}_{q}$ and $\mathbb{Z}_{k}$ in terms of the compositions of $n$ and their distributions in the…

Combinatorics · Mathematics 2021-03-09 Himadri Shekhar Chakraborty , Tsuyoshi Miezaki

Let $X$ be a complex $K3$ surface with an effective action of a group $G$ which preserves the holomorphic symplectic form. Let $$ Z_{X,G}(q) = \sum_{n=0}^{\infty} e\left(\operatorname{Hilb}^{n}(X)^{G} \right)\, q^{n-1} $$ be the generating…

Algebraic Geometry · Mathematics 2025-04-23 Jim Bryan , Ádám Gyenge

Inspired by Lehmer's conjecture on the nonvanishing of the Ramanujan $\tau$-function, one may ask whether an odd integer $\alpha$ can be equal to $\tau(n)$ or any coefficient of a newform $f(z)$. Balakrishnan, Craig, Ono, and Tsai used the…

Number Theory · Mathematics 2021-04-07 Malik Amir , Letong Hong

A total weighting of a graph $G$ is a mapping $\phi$ that assigns a weight to each vertex and each edge of $G$. The vertex-sum of $v \in V(G)$ with respect to $\phi$ is $S_{\phi}(v)=\sum_{e\in E(v)}\phi(e)+\phi(v)$. A total weighting is…

Combinatorics · Mathematics 2024-01-17 Yunfang Tang , Yuting Yao

Special arithmetic series $f(x)=\sum_{n=0}^{\infty}c_nx^n$, whose coefficients $c_n$ are normally given as certain binomial sums, satisfy "self-replicating" functional identities. For example, the equation…

Number Theory · Mathematics 2018-01-24 Shaun Cooper , Jesús Guillera , Armin Straub , Wadim Zudilin

In this paper, we find asymptotic formula for the following sum with explicit error term: \[M_{x}(g_{1}, g_{2}, g_3)=\frac{1}{x}\sum_{n\le x}g_{1}(F_1(n))g_{2}(F_2(n))g_{3} (F_3(n)),\] where $F_1(x), F_2(x)$ and $F_3(x)$ are polynomials…

Number Theory · Mathematics 2016-08-10 Pranendu Darbar

In this paper, we establish the following two congruences: \begin{gather*} \sum_{k=0}^{(p+1)/2}(3k-1)\frac{\left(-\frac{1}{2}\right)_k^2\left(\frac{1}{2}\right)_k4^k}{k!^3}\equiv…

Number Theory · Mathematics 2020-06-30 Chen Wang

Often in mathematics it is useful to summarize a multivariate phenomenon with a single number and in fact, the determinant -- which is represented by det -- is one of the simplest cases. In fact, this number it is defined only for square…

Commutative Algebra · Mathematics 2009-09-17 R. S. Costas-Santos

Let $G$ be a graph with the vertex set $ \lbrace v_1,\ldots,v_n \rbrace$. The Seidel matrix of $G$ is an $n\times n$ matrix whose diagonal entries are zero, $ij$-th entry is $-1$ if $ v_{i} $ and $ v_{j} $ are adjacent and otherwise is $ 1…

Let $S$ be a subset of a group $G$ (not necessarily abelian) such that $S\,\cap -S$ is empty or contains only elements of order $2$, and let $\mathbf{h}=(h_1,\ldots, h_m)\in \mathbb{N}^m$ and $\mathbf{k}=(k_1, \ldots, k_n)\in \mathbb{N}^n$.…

Combinatorics · Mathematics 2026-05-06 Lorenzo Mella , Tommaso Traetta

For a graph $G$ of order $n$, let $$ \lambda_1(G)\ge \cdots \ge \lambda_n(G) $$ be the eigenvalues of its adjacency matrix. We prove that every graph $G$ on $n\ge 3$ vertices satisfies $$ \lambda_3(G)\le \frac{n}{3}-1, $$ thereby solving a…

Combinatorics · Mathematics 2026-03-24 Quanyu Tang

We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N,E) where N is a (so called) ``neutral'' alternating sign matrix (with one -1) and E is an integer. The bijection preserves the classical…

Combinatorics · Mathematics 2007-05-23 Pierre Lalonde

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Number Theory · Mathematics 2022-12-01 Hrishabh Mishra , Anwesh Ray

The noncommutative (or mixed) trace algebra $T_{nd}$ is generated by $d$ generic $n\times n$ matrices and by the algebra $C_{nd}$ generated by all traces of products of generic matrices, $n,d\geq 2$. It is known that over a field of…

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

Karonski, Luczak, and Thomason (2004) conjectured that, for any connected graph G on at least three vertices, there exists an edge weighting from {1,2,3} such that adjacent vertices receive different sums of incident edge weights.…

Combinatorics · Mathematics 2012-11-22 Ben Seamone , Brett Stevens

The finite ring Z_k = Z(+,.) mod p^k of residue arithmetic with odd prime power modulus is analysed. The cyclic group of units G_k in Z_k(.) has order (p-1)p^{k-1}, implying product structure G_k = A_k B_k. Here core A_k of order p-1 is an…

General Mathematics · Mathematics 2007-05-23 N. F. Benschop

For the OEIS sequence A214615, defined by $a(n) = M_{n}(1)$ where $M_{n}$ is the $n$-th Meixner polynomial satisfying $M_{n+1}(x) = x\,M_{n}(x) - n^{2}\,M_{n-1}(x)$, R.~J.~Mathar contributed on 6~March 2013 the conjectured order-2…

Combinatorics · Mathematics 2026-05-07 Tong Niu

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

We introduce the new notion of a conjugate weight function and provide a detailed study of this operation and its properties. Then we apply this knowledge to study classes of ultradifferentiable functions defined in terms of fast growing…

Functional Analysis · Mathematics 2026-03-31 Gerhard Schindl