相关论文: Enumerating the Saneblidze-Umble diagonal terms

A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

We review the recent progress on the numerical implementation of the Loop-Tree Duality Method (LTDM) for the calculation of scattering amplitudes. A central point is the analysis of the singularities of the integrand. In the framework of…

We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…

In this paper, we study some properties of umbral calculus related to Appell sequence. From those properties, we derive new and interesting identities of Frobenius-Euler polynomials.

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…

We give an explicit expression of the normalized characters of the symmetric group in terms of the contents of the partition labelling the representation.

A method is presented for fast diagonalization of a 2x2 or 3x3 real symmetric matrix, that is determination of its eigenvalues and eigenvectors. The Euler angles of the eigenvectors are computed. A small computer algebra program is used to…

A method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in Q and Z_p from a matrix presentation of the finite biquandle is described. We also describe a method for computing the…

We give asymptotic approximations of the zeros of certain high degree polynomials. The zeros can be used to compute the filter coefficients in the dilation equations which define the compactly supported orthogonal Daubechies wavelets.…

These notes develop aspects of perturbation theory of matrices related to so-called diagonalisation schemes. Primary focus is on constructive tools to derive asymptotic expansions for small/large parameters of eigenvalues and…

This article provides a quick guide to the implementation of supersymmetry with Cadabra, a symbolic computer algebra system. Details are provided on the implementation of Grassmann variables, fermionic fields, supercharges, and…

The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…

In this paper, we compute universal estimates of eigenvalues for a class of coupled systems of elliptic differential equations in divergence form on a bounded domain in Euclidean space, which includes the well-known Lam\'e and the Laplacian…

Formulating a Schubert problem as the solutions to a system of equations in either Pl\"ucker space or in the local coordinates of a Schubert cell typically involves more equations than variables. We present a novel primal-dual formulation…

The purpose of this paper is to introduce and investigate the notion of derivation for quandle algebras. More precisely, we describe the symmetries on structure constants providing a characterization for a linear map to be a derivation. We…

Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…

In this paper we study summability based on double sequences of complex constants as it is defined in "Linear Operators, General Theory" by N. Dunford and J. T. Schwartz. We define "power double sequences" or infinite "power matrices" as…