Related papers: Explicit Pieri Inclusions

We define linearly reducible elliptic Feynman integrals, and we show that they can be algorithmically solved up to arbitrary order of the dimensional regulator in terms of a 1-dimensional integral over a polylogarithmic integrand, which we…

The Weil representation of the symplectic group associated to a finite abelian group of odd order is shown to have a multiplicity-free decomposition. When the abelian group is p-primary, the irreducible representations occurring in the Weil…

Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

In this talk we discuss a class of Feynman integrals, which can be expressed to all orders in the dimensional regularisation parameter as iterated integrals of modular forms. We review the mathematical prerequisites related to elliptic…

We investigate tensor products of random matrices, and show that independence of entries leads asymptotically to $\varepsilon$-free independence, a mixture of classical and free independence studied by M{\l}otkowski and by Speicher and…

We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…

We use the theory of skew duality to show that decomposing the tensor product of $k$ irreducible representations of the symplectic group $Sp_{2m} = Sp_{2m}(C)$ is equivalent to branching from $Sp_{2n}$ to $Sp_{2n_1}\times\cdots\times…

Consider $n$ points $X_1,\ldots,X_n$ in $\mathbb R^d$ and denote their convex hull by $\Pi$. We prove a number of inclusion-exclusion identities for the system of convex hulls $\Pi_I:=conv(X_i\colon i\in I)$, where $I$ ranges over all…

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

For every genuine irreducible admissible smooth representation $\pi$ of the metaplectic group $\widetilde{\Sp}(2n)$ over a p-adic field, and every smooth oscillator representation $\omega_\psi$ of $\widetilde{\Sp}(2n)$, we prove that the…

Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…

Braided differential operators $\del^i$ are obtained by differentiating the addition law on the braided covector spaces introduced previously (such as the braided addition law on the quantum plane). These are affiliated to a Yang-Baxter…

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

We consider the three finite free convolutions for polynomials studied in a recent paper by Marcus, Spielman, and Srivastava. Each can be described either by direct explicit formulae or in terms of operations on randomly rotated matrices.…

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

In this work, linearized multivariate skew polynomials over division rings are introduced. Such polynomials are right linear over the corresponding centralizer and generalize linearized polynomial rings over finite fields, group rings or…