相关论文: Note on symmetric BCJ numerator
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
A symmetrising shift employed by Frenkel and Hartnoll in the approximate computation of the elements of matrix spherical harmonics is further explored and shown to be related to the permutation symmetry of 3-j symbols yielding an extension…
The notation of generalized Bessel multipliers is obtained by a bounded operator on $\ell^2$ which is inserted between the analysis and synthesis operators. We show that various properties of generalized multipliers are closely related to…
The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24…
We calculate planar, tree-level, non-extremal three-point functions of operators belonging to the SU(2) x SU(2) sector of ABJM theory. First, we generalize the determinant representation, found by Foda for the three-point functions of the…
This is an ultimate completion of our earlier paper [Acta.\ Math.\ Hungar.\ 140 (2013), 248--292] where mapping properties of several fundamental harmonic analysis operators in the setting of symmetrized Jacobi trigonometric expansions were…
The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…
The three different sets of Bethe ansatz equations describing the Bethe ansatz solution of the supersymmetric t-J model are known to be equivalent. Here we give a new, simplified proof of this fact which relies on the properties of certain…
A distributed algorithm is described for solving a linear algebraic equation of the form $Ax=b$ assuming the equation has at least one solution. The equation is simultaneously solved by $m$ agents assuming each agent knows only a subset of…
The symmetrized quartic polynomial oscillator is shown to admit an sl(2,$\R$) algebraization. Some simple quasi-exactly solvable (QES) solutions are exhibited. A new symmetrized sextic polynomial oscillator is introduced and proved to be…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
A formula is derived that provides generating functions for any multi-j-symbol, such as the 3-j-symbol, the 6-j-symbol, the 9-j-symbol, etc. The result is completely determined by geometrical objects (loops and curves) in the graph of the…
This paper presents an algorithmic method that, given a positive integer $j$, generates the $j$-th convergence stair containing all natural numbers from where the Collatz conjecture holds by exactly $j$ applications of the Collatz function.…
Suppose $\Cal J$ is a two-sided quasi-Banach ideal of compact operators on a separable infinite-dimensional Hilbert space $\Cal H$. We show that an operator $T\in\Cal J$ can be expressed as finite linear combination of commutators $[A,B]$…
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
In this article, we continue the investigation of hep-th 1611.02179 regarding iterative properties of dual conformal integrals in higher dimensions. In d=4, iterative properties of four and five point dual conformal integrals manifest…
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…
It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.
A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…