Related papers: Note on symmetric BCJ numerator
We consider $cp_{a,b,m}(n)$, the number of $(a,b,m)$-copartitions of $n$. We find many infinitelymany congruencesmodulo 2 and 6 for some particular value of $a$, $b$ and $m$.
We prove an identity [Eq. (1) below] among SU(2) 6j and 9j symbols that generalizes the Biedenharn-Elliott sum rule. We prove the result using diagrammatic techniques (briefly reviewed here), and then provide an algebraic proof. This…
The Stirling numbers of type $B$ of the second kind count signed set partitions. In this paper we provide new combinatorial and analytical identities regarding these numbers as well as Broder's $r$-version of these numbers. Among these…
Jaberi [7] presented approximation algorithms for the problem of computing a minimum size 2-vertex strongly biconnected subgraph in directed graphs. We have implemented approximation algorithms presented in [7] and we have tested the…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
In a recent paper Donaldson defines three operators on a space of Hermitian metrics on a complex projective manifold: $T, T_{\nu}, T_K.$ Iterations of these operators converge to balanced metrics, and these themselves approximate constant…
Recently, Andrews, Hirschhorn and Sellers have proven congruences modulo 3 for four types of partitions using elementary series manipulations. In this paper, we generalize their congruences using arithmetic properties of certain quadratic…
In this paper, we derive certain congruences for the number of $3$-core cubic bipartitions using elementary $q$-series manipulations and dissection formulas.
Let six points $1, ...6$ lie in general position in the real projective plane and consider the pencil of nodal cubics based at these points, with node at one of them, say 1. This pencil has five reducible cubics. We call combinatorial cubic…
We show that there are $O(B^{3/5-3/1555+\ep})$ triples $(x,y,z)$ of square-full integesr up to $B$ satisfying the equation $x+y=z$ for any fixed $\ep>0$. This is the first improvement over the `easy' exponent $3/5$, given by Browning and…
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…
We revisit the definition of the 6j-symbols from the modular double of U_q(sl(2,R)), referred to as b-6j symbols. Our new results are (i) the identification of particularly natural normalization conditions, and (ii) new integral…
Within the field of numerical multilinear algebra, block tensors are increasingly important. Accordingly, it is appropriate to develop an infrastructure that supports reasoning about block tensor computation. In this paper we establish…
There are 339 combinatorial types of generic metrics on six points. They correspond to the 339 regular triangulations of the second hypersimplex \Delta(6,2), which also has 14 non-regular triangulations.
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
We introduce a new criterion which tests if a given decomposition of a given ternary form $T$ of even degree is unique. The criterion is based on the analysis of the Hilbert function of the projective set of points $Z$ associated to the…
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…
We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…
Estimation of actual errors from the residue in iterative solutions is necessary for efficient solution of large problems when their condition number is much larger than one. Such estimators for conjugate gradient algorithms used to solve…
In this article, the reproducing kernel Hilbert space [0, 1] is employed for solving a class of third-order periodic boundary value problem by using fitted reproducing kernel algorithm. The reproducing kernel function is built to get fast…