Related papers: (-1)-Enumerations of arrowed Gelfand-Tsetlin patte…
Arrow diagram (AD) method (L. Kantorovich and B. Zapol, J. Chem. Phys. \textbf{96}, 8420 (1992); \emph{ibid}, 8427) provides a convenient means of systematic calculation of arbitrary matrix elements, $<\Psi|\hat{O}|\Psi>$, of symmetrical…
We develop a new symbolic-numeric algorithm for the certification of singular isolated points, using their associated local ring structure and certified numerical computations. An improvement of an existing method to compute inverse systems…
Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of L-functions in families with the same…
Inspired by the results of [R. Adin, A. Postnikov, Y. Roichman, Combinatorial Gelfand model, preprint math.RT arXiv:0709.3962], we propose combinatorial Gelfand models for semigroup algebras of some finite semigroups, which include the…
Letting $(t_n)$ denote the Thue-Morse sequence with values $0, 1$, we note that the Woods-Robbins product $$ \prod_{n \geq 0} \left(\frac{2n+1}{2n+2}\right)^{(-1)^{t_n}} = 2^{-1/2} $$ involves a rational function in $n$ and the $\pm 1$…
Let $p$ be an odd prime and $d = p^{\tau}(p-1)$. In the spirit of Aritn's conjecture, consider the system of two diagonal forms of degree $d$ in $s$ variables given by \begin{equation*}\begin{split} a_1x_1^d + \cdots + a_sx_s^d = 0\\…
Ellipses are a meta-linguistic notation for denoting terms the size of which are specified by a meta-variable that ranges over the natural numbers. In this work, we present a systematic approach for encoding such meta-expressions in the…
We give a survey on the Littlewood-Richardson rule. Using Gelfand-Tsetlin patterns as the main machinery of our analysis, we study the interrelationship of various combinatorial descriptions of the Littlewood-Richardson rule.
We prove pairwise disjointness of representations T_{z,w} of the infinite-dimensional unitary group. These representations provide a natural generalization of the regular representation for the case of "big" group U(\infty). They were…
We give a new representation-theoretic proof of the branching rule for Macdonald polynomials using the Etingof-Kirillov Jr. expression for Macdonald polynomials as traces of intertwiners of U_q(gl_n). In the Gelfand-Tsetlin basis, we show…
The aim of this note is to provide a simple proof of some well-known identities and recurrences relating classical Bernoulli and Euler numbers by using the Abel sum of the divergent series $\sum_{n=0}^\infty (-1)^{n} (n+1)^k$, $k$ a…
We define a quotient of the category of finitely generated modules over the cyclotomic Khovanov-Lauda-Rouquier algebra for type An and show it has a module category structure over a direct sum of certain cyclotomic Khovanov-Lauda-Rouquier…
We study the asymptotic representation for the zeros of the deformed exponential function $\sum\nolimits_{n = 0}^\infty {\frac1{n!}{q^{n(n - 1)/2}{x^n}}} $, $q\in (0,1)$. Indeed, we obtain an asymptotic formula for these zeros: \[x_n=-…
We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…
Based on the matrix expression of general nonlinear numerical analogues presented by the present author, this paper proposes a novel philosophy of nonlinear computation and analysis. The nonlinear problems are considered an ill-posed linear…
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…
We provide a simple and natural solution to the problem of generating all $2^n \cdot n!$ signed permutations of $[n] = \{1,2,\ldots,n\}$. Our solution provides a pleasing generalization of the most famous ordering of permutations: plain…
Let $\sum_{d|n}$ denote sum over divisors of a positive integer $n$, and $t_{r}(n)$ denote the number of representations of $n$ as a sum of $r$ triangular numbers. Then we prove that $$…
In this paper, we propose an algebraic formalization of the two important classes of dynamic programming algorithms called forward and forward-backward algorithms. They are generalized extensively in this study so that a wide range of other…
The $(-1)$-Jacobi, Bannai-Ito, and $(-1)$-Meixner-Pollaczek polynomials are studied in [Trans. Amer. Math. Soc. 364 (2012), 5491-5507], [Adv. Math. 229 (2012), 2123-2158], and [Stud. Appl. Math. 153 (2024), e12728], respectively, through…