English
Related papers

Related papers: Using Hook Schur Functions to Compute Matrix Cocha…

200 papers

In the work we propose an algorithm for a Wiener -- Hopf factorization of scalar polynomials based on notions of indices and essential polynomials. The algorithm uses computations with finite Toeplitz matrices and permits to obtain…

Numerical Analysis · Mathematics 2018-06-06 Victor Adukov

A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…

Combinatorics · Mathematics 2014-11-14 Jacob P. Dyer

We give the Thom polynomials for the singularities $I_{2,2}$ associated with maps $({\bf C}^{\bullet},0) \to ({\bf C}^{\bullet+k},0)$ with parameter $k\ge 0$. Our computations combine the characterization of Thom polynomials via the…

Algebraic Geometry · Mathematics 2007-05-23 Piotr Pragacz

Convolutions or Hadamard products of analytic functions is a well explored area of research and many nice results are available in literature. On the other hand, very little is known in general about the convolutions of univalent harmonic…

Complex Variables · Mathematics 2019-11-07 Chinu Singla , Sushma Gupta , Sukhjit Singh

Using loop equation technics, we compute all mixed traces correlation functions of the 2-matrix model to large N leading order. The solution turns out to be a sort of Bethe Ansatz, i.e. all correlation functions can be decomposed on…

High Energy Physics - Theory · Physics 2009-11-24 B. Eynard , N. Orantin

This paper shows that, for matrix multiplications and convolutions, it is possible to asymptotically replace each real multiplication with a single squaring operation. Similarly, a single complex multiplication can be replaced with 3…

Hardware Architecture · Computer Science 2026-03-11 Vincenzo Liguori

We introduce a method for calculating individual elements of matrix functions. Our technique makes use of a novel series expansion for the action of matrix functions on basis vectors that is memory efficient even for very large matrices. We…

Computational Physics · Physics 2021-11-18 Lev Barash , Stefan Güttel , Itay Hen

The multidimensional chain rule formula for analytic functions and its generalisation to higher derivatives perfectly work in the algebraic setting in characteristic zero. In positive characteristic one runs into problems due to…

Commutative Algebra · Mathematics 2020-08-18 Andreas Maurischat

In this article we introduce algorithms which compute iterations of Gauss-Manin connections, Picard-Fuchs equations of Abelian integrals and mixed Hodge structure of affine varieties of dimension $n$ in terms of differential forms. In the…

Algebraic Geometry · Mathematics 2007-05-23 Hossein Movasati

In this paper, we investigate some properties of several Sheffer sequences of several polynomials arising from umbral calculus. From our investigation, we can derive many interesting identities of several polynomials

Number Theory · Mathematics 2013-02-21 Taekyun Kim , Dae San Kim , Seog-Hoon Rim , Dmitry V. Dolgy

In this paper, we define Tribonacci and Tribonacci-Lucas matrix sequences and investigate their properties.

Number Theory · Mathematics 2018-09-24 Yüksel Soykan

We obtain a new formula to relate the value of a Schur polynomial with variables $(x_1,\ldots,x_N)$ with values of Schur polynomials at $(1,\ldots,1)$. This allows to study the limit shape of perfect matchings on a square hexagon lattice…

Probability · Mathematics 2021-09-30 Zhongyang Li

Using supercharacter theory, we identify the matrices that are diagonalized by the discrete cosine and discrete sine transforms, respectively. Our method affords a combinatorial interpretation for the matrix entries.

Functional Analysis · Mathematics 2021-02-05 Stephan Ramon Garcia , Samuel Yih

Stretching is a new sparse matrix method that makes matrices sparser by making them larger. Stretching has implications for computational complexity theory and applications in scientific and parallel computing. It changes matrix sparsity…

Numerical Analysis · Mathematics 2012-03-13 Joseph F. Grcar

In this article, the enumeration of partial chord diagrams is discussed via matrix model techniques. In addition to the basic data such as the number of backbones and chords, we also consider the Euler characteristic, the backbone spectrum,…

We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…

Group Theory · Mathematics 2019-05-24 William R. Unger

Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…

Representation Theory · Mathematics 2024-12-10 Sefi Ladkani

We want to compute generic $\mathrm{Ext}$-spaces of twisted polynomial functors in relation to the $\mathrm{Ext}$-spaces of the untwisted ones, modulo a parametrisation. Thanks to the study of a spectral sequence we get to a computation in…

Algebraic Topology · Mathematics 2026-01-28 Iacopo Giordano

We present a new method for computing the zeta function of an algebraic curve over a finite field. The algorithm relies on a trace formula of Harvey to count points on a plane model of the curve. The zeta function of the curve is then…

Number Theory · Mathematics 2022-03-07 Madeleine Kyng

A remarkable feature of Schur functions -- the common eigenfunctions of cut-and-join operators from $W_\infty$ -- is that they factorize at the peculiar two-parametric topological locus in the space of time-variables, what is known as the…

High Energy Physics - Theory · Physics 2016-09-12 Ya. Kononov , A. Morozov
‹ Prev 1 8 9 10 Next ›