Related papers: Enumerating the Saneblidze-Umble diagonal terms

This paper provides a combinatorial dictionary between three sets of objects: Bernstein-Zelevinsky multisegments, Kleshchev multipartitions, and the irreducible modules of the affine Hecke algebra $H_n$ (for generic $q$). In particular, we…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

A polynomial counterpart of the Seiberg-Witten invariant associated with a negative definite plumbed 3-manifold has been proposed by earlier work of the authors. It is provided by a special decomposition of the zeta-function defined by the…

Computing explicitly the {\epsilon}-subdifferential of a proper function amounts to computing the level set of a convex function namely the conjugate minus a linear function. The resulting theoretical algorithm is applied to the the class…

This paper is part of a series of papers in which the asymptotic theory and appropriate symbolic computer code are developed to compute the asymptotic expansion of the solution of an n-th order ordinary differential equation. The paper…

We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained four-Ramond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the…

In this paper we discuss some relations between the eigenvalues and the diagonal entries of Hermitian matrices.

This survey is an extended version of lectures given at the Cornell Probability Summer School 2013. The fundamental facts about the Abelian sandpile model on a finite graph and its connections to related models are presented. We discuss…

Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…

I show how applying a symplectic Gram-Schmidt orthogonalization to the normalizer of a quantum code gives a different way of determining the code's logical operators. This approach may be more natural in the setting where we produce a…

We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…

Explicit general constructions of paragrassmann calculus with one and many variables are given. Relations of the paragrassmann calculus to quantum groups are outlined and possible physics applications are briefly discussed. This paper is…

This paper introduces a colored generalization of the Eulerian polynomials, denoted the $\alpha$-colored Eulerian polynomials. We first compute these polynomials by taking the $h$-vector of the $\alpha$-colored permutohedron, a colored…

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline…

Given a multi-variable polynomial, there is an associated divided symmetrization (in particular turning it into a symmetric function). Postinkov has found the volume of a permutohedron as a divided symmetrization (DS) of the power of a…

A numerical algorithm (implemented in Matlab) for computing the zeros of the parabolic cylinder function $U(a,z)$ in domains of the complex plane is presented. The algorithm uses accurate approximations to the first zero plus a highly…

We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the nth polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be…

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…

We present a calculation of the rational terms in two-loop all-plus gluon amplitudes using $D$-dimensional unitarity. We use a conjecture of separability of the two loops, and then a simple generalization of one-loop $D$-dimensional…