相关论文: Note on symmetric BCJ numerator

We develop an algorithm for recursively constructing orthogonal multiplet bases for the color space of QCD, for any order of partons and any Nc. This recipe is then applied for explicitly constructing some of these bases. Using the bases, a…

This paper studies nuclear norms of symmetric tensors. As recently shown by Friedland and Lim, the nuclear norm of a symmetric tensor can be achieved at a symmetric decomposition. We discuss how to compute symmetric tensor nuclear norms,…

We present the first complete derivation of the well-known asymptotic expansion of the SU(2) 6j symbol using a coherent state approach, in particular we succeed in computing the determinant of the Hessian matrix. To do so, we smear the…

We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…

A representation of the Pad\'e approximation of the $Z$-transform of a signal as a resolvent of a tridiagonal matrix $J$ is given. Several formulas for the poles, zeros and residues of the Pad\'e approximation in terms of the matrix $J$ are…

Recently, B\'{e}nyi and the second author introduced two combinatorial interpretations for symmetrized poly-Bernoulli polynomials. In the present study, we construct bijections between these combinatorial objects. We also define various…

Let $\mathbb{M}$ be the group of multiplicative characters of a finite field $\mathbb{F}$, and let $\mathbb{J}(\alpha, \beta)$ be the Jacobi sum, for $\alpha, \beta \in \mathbb{M}$. We observe that the function $\mathbb{J} \colon \mathbb{M}…

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

Stirling number of the first and the second kinds have seen many generalizations and applications in various areas of mathematics. We introduce some combinatorial parameters which realize $q$-analogues and Broder's $r$-variants of Stirling…

Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular…

We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…

We describe a simple but surprisingly effective technique of obtaining spectral multiplier results for abstract operators which satisfy the finite propagation speed property for the corresponding wave equation propagator. We show that, in…

Let $C$ be a conjugation on a Hilbert space $\mathcal{H}$. A densely defined linear operator $A$ on $\mathcal{H}$ is called $C$-symmetric if $CAC\subseteq A^*$ and $C$-self-adjoint if $CAC=A^*$. Our main results describe all…

In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…

This paper solves the Sylvester equation in the form of AX+XB=C in a distributed way, and proposes three distributed continuous-time algorithms for three cases. We start with the basic algorithm for solving a least squares solution of the…

We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…

We prove that all algebraic bases $\beta$ allow an eventually periodic representations of the elements of $\mathbb Q(\beta)$ with a finite alphabet of digits $\mathcal A$. Moreover, the classification of bases allowing that those…

The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…

We consider three problems from the recent issues of the American Mathematical Monthly involving different versions of Catalan triangle. Our main results offer generalizations of these identities and demonstrate automated proofs with…

The main purpose of this paper is, in the general setting of the adjointable operators on Hilbert $C^*$-modules, to develop two new tools that can be applied to deal with the positive solutions of certain operator equations, the operator…