English
Related papers

Related papers: Hook-lengths and Pairs of Compositions

200 papers

Brawley and Carlitz introduced diamond products of elements of finite fields and associated composed products of polynomials in 1987. Composed products yield a method to construct irreducible polynomials of large composite degrees from…

Number Theory · Mathematics 2024-02-23 Lukas Kölsch , Lucas Krompholz , Gohar M. Kyureghyan

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…

q-alg · Mathematics 2008-02-03 Friedrich Knop , Siddhartha Sahi

Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…

Mathematical Software · Computer Science 2015-05-05 Jan Verschelde , Xiangcheng Yu

We consider certain matrix-products where successive matrices in the product belong alternately to a particular qualitative class or its transpose. The main theorems relate structural and spectral properties of these matrix-products to the…

Combinatorics · Mathematics 2015-02-25 Murad Banaji , Carrie Rutherford

We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of…

Combinatorics · Mathematics 2024-06-27 Catherine Cossaboom

In the present paper we introduce the notion of harmonicity modulus and harmonicity K-functional and apply these notions to prove a Jackson type theorem for approximation of continuous functions by polyharmonic functions. For corresponding…

Numerical Analysis · Mathematics 2010-05-28 Ognyan Kounchev

In a recent work, we have initiated the theory of N=2 symmetric superpolynomials. As far as the classical bases are concerned, this is a rather straightforward generalization of the N=1 case. However this construction could not be…

Mathematical Physics · Physics 2018-01-09 Ludovic Alarie-Vézina , Luc Lapointe , Pierre Mathieu

There are $k$ kinds of length $k$ hooks with different arm length. Actually, this $k$ kinds appear uniformly in Young diagrams of size $n$. The property ``appear uniformly'' is called super symmetric. We give a combinatorial proof of the…

Combinatorics · Mathematics 2019-04-09 Masanori Ando

An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…

Combinatorics · Mathematics 2021-08-17 Fumio Hazama

Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…

Algebraic Geometry · Mathematics 2007-05-23 Andrew J. Sommese , Jan Verschelde

A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…

Complex Variables · Mathematics 2016-10-11 Andrew Thomack

We provide a categorical framework for mathematical objects for which there is both a sort of "independent" and "dependent" composition. Namely we model them as duoidal categories in which both monoidal structures share a unit and the first…

Category Theory · Mathematics 2025-01-27 Brandon T. Shapiro , David I. Spivak

We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…

Representation Theory · Mathematics 2007-05-23 Anthony Henderson

We consider the chordal product determinant, a measure of the distance between two subspaces of the same dimension. In information theory, collections of elements in the complex Grassmannian are searched with the property that their…

Information Theory · Computer Science 2022-10-06 Javier Álvarez-Vizoso , Carlos Beltrán , Diego Cuevas , Ignacio Santamarıa , Vit Tucek , Gunnar Peters

We consider sequential or active ranking of a set of n items based on noisy pairwise comparisons. Items are ranked according to the probability that a given item beats a randomly chosen item, and ranking refers to partitioning the items…

Machine Learning · Computer Science 2016-09-26 Reinhard Heckel , Nihar B. Shah , Kannan Ramchandran , Martin J. Wainwright

We present a non-vacuous definition of compositionality. It is based on the idea of combining the minimum description length principle with the original definition of compositionality (that is, that the meaning of the whole is a function of…

Computation and Language · Computer Science 2007-05-23 Wlodek Zadrozny

The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…

Combinatorics · Mathematics 2025-12-25 Priyanshu Pant , Surabhi Chakrabartty , Ranveer Singh

By using the Hadamard matrix product concept, this paper introduces two generalized matrix formulation forms of numerical analogue of nonlinear differential operators. The SJT matrix-vector product approach is found to be a simple,…

Computational Engineering, Finance, and Science · Computer Science 2024-09-21 W. Chen

We study two new families of symmetric functions arising from a species-theoretic construction motivated by cycle structure. For each partition of $n$, we define two combinatorial species that decompose into molecules indexed by the same…

Combinatorics · Mathematics 2026-04-14 Josaphat Baolahy , Randrianirina Benjamin

We give a geometric method for determining the cohomology groups of a polyhedral product under suitable freeness conditions or with coefficients taken in a field. This is done by considering first the special case for which the pairs of…

Algebraic Topology · Mathematics 2023-05-24 A. Bahri , M. Bendersky , F. R. Cohen , S. Gitler