Related papers: Note on symmetric BCJ numerator
The eigenvalue hypothesis claims that any quantum Racah matrix for finite-dimensional representations of $U_q(sl_N)$ is uniquely determined by eigenvalues of the corresponding quantum $\cal{R}$-matrices. If this hypothesis turns out to be…
The notion of generalized Bell numbers has appeared in several works but there is no systematic treatise on this topic. In this paper we fill this gap. We discuss the most important combinatorial, algebraic and analytic properties of these…
In this work, we state a general conjecture on the solvability of optimization problems via algorithms with linear convergence guarantees. We make a first step towards examining its correctness by fully characterizing the problems that are…
We derive several symmetric identities for Bernoulli and Euler polynomials which imply some known identities. Our proofs depend on the new technique developed in part I and some identities obtained in [European J. Combin. 24(2003),…
We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of partial and…
We construct an algorithm for solving the following problem: given a number field $K$, a positive integer $N$, and a positive real number $B$, determine all points in $\mathbb P^N(K)$ having relative height at most $B$. A theoretical…
The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of…
We extend the Bell inequality known for two qubits to the four-level atom, including an artificial atom realized by the superconducting circuit, and qudit with j=3/2. We formulate the extended inequality as the inequality valid for an…
We present a method for tabulating all cubic function fields over $\mathbb{F}_q(t)$ whose discriminant $D$ has either odd degree or even degree and the leading coefficient of $-3D$ is a non-square in $\mathbb{F}_{q}^*$, up to a given bound…
Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…
We study numerical methods for the solution of general linear moment problems, where the solution belongs to a family of nested subspaces of a Hilbert space. Multi-level algorithms, based on the conjugate gradient method and the…
Aharonov, Jones, and Landau [Algorithmica 55, 395 (2009)] have presented a polynomial quantum algorithm for approximating the Jones polynomial. We investigate the bipartite entanglement properties in AJL's algorithm for three-strand braids.…
A fully algebraic approach to reconstructing one-dimensional reflectionless potentials is described. A simple and easily applicable general formula is derived, using the methods of the theory of determinants. In particular, useful…
We prove pointwise bounds for two-parameter families of Jacobi polynomials. Our bounds imply estimates for a class of functions arising from the spectral analysis of distinguished Laplacians and sub-Laplacians on the unit sphere in…
J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…
We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx. Operations can be composed, and connected by pointwise-defined logical junctors. We consider the…