English
Related papers

Related papers: Polynomial quotient rings and Kronecker substituti…

200 papers

Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…

Number Theory · Mathematics 2026-01-07 Chen Lin , Kaihan Tang

By applying p-adic integral on the set of p-adic integers in [27] (Interpolation Functions for New Classes Special Numbers and Polynomials via Applications of p-adic Integrals and Derivative Operator, Montes Taurus J. Pure Appl. Math. 3…

Combinatorics · Mathematics 2021-03-04 Yilmaz Simsek

In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…

Combinatorics · Mathematics 2025-04-02 Kunle Adegoke , Robert Frontczak , Karol Gryszka

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

Number Theory · Mathematics 2010-02-18 Mohamed El Bachraoui

We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower bounds for the permanent polynomial. Moreover, we prove the…

Computational Complexity · Computer Science 2017-08-14 Christian Ikenmeyer , Greta Panova

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

Number Theory · Mathematics 2024-04-02 Yasuhiro Ishitsuka , Takashi Taniguchi , Frank Thorne , Stanley Yao Xiao

Let kK be the path algebra of the Kronecker quiver and consider the category of finite dimensional right modules over kK (called Kronecker modules). We prove that extensions of Kronecker modules are field independent up to Segre classes, so…

Representation Theory · Mathematics 2014-09-02 Csaba Szántó

We prove a combinatorial identity relating Catalan numbers to tangent numbers arising from the study of peak algebra that was conjectured by Aliniaeifard and Li. This identity leads to the discovery of the intriguing identity $$…

Combinatorics · Mathematics 2025-08-13 Tongyuan Zhao , Zhicong Lin , Yongchun Zang

We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…

General Mathematics · Mathematics 2007-05-23 Gerry Martens

For each positive integer $n$ it is shown how to construct a finite collection of multivariable polynomials $\{F_{i}:=F_{i}(t,X_{1},..., X_{\lfloor \frac{n+1}{2} \rfloor})\}$ such that each positive integer whose squareroot has a continued…

Number Theory · Mathematics 2019-01-07 James Mc Laughlin

In a recent paper, Griffin, Ono and Warnaar present a framework for Rogers-Ramanujan type identities using Hall-Littlewood polynomials to arrive at expressions of the form \[\sum_{\lambda : \lambda_1 \leq m}…

Number Theory · Mathematics 2015-06-22 Hannah Larson

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

Combinatorics · Mathematics 2016-09-12 Soumyabrata Pal , Shankar M. Venkatesan

By considering a limiting case of a Kronecker-type identity, we obtain an identity found by both Andrews and Crandall. We then use the Andrews-Crandall identity to give a new proof of a formula of Gauss for the representations of a number…

Number Theory · Mathematics 2018-01-31 Eric T. Mortenson

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

Combinatorics · Mathematics 2025-11-06 Owen John Levens

For an arbitrary representation $\rho$ of a complex finite-dimensional Lie algebra, we construct a collection of numbers that we call the Jordan-Kronecker invariants of $\rho$. Among other interesting properties, these numbers provide lower…

Representation Theory · Mathematics 2019-12-02 Alexey Bolsinov , Anton Izosimov , Ivan Kozlov

Dendriform structures arise naturally in algebraic combinatorics (where they allow, for example, the splitting of the shuffle product into two pieces) and through Rota-Baxter algebra structures (the latter appear, among others, in…

Combinatorics · Mathematics 2021-02-01 Kurusch Ebrahimi-Fard , Dominique Manchon , Frédéric Patras

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

Combinatorics · Mathematics 2014-12-17 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…

Combinatorics · Mathematics 2023-07-03 Greta Panova

While there has been some progress on the decomposition of Kronecker products of characters of the symmetric groups in recent times, results on the symmetric and alternating part of Kronecker squares are still scarce. Here, new results (and…

Combinatorics · Mathematics 2023-01-20 Christine Bessenrodt , Chris Bowman

We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a…

Symbolic Computation · Computer Science 2007-12-27 David Harvey