English
Related papers

Related papers: Source Code for Computing Giambelli's Formula for …

200 papers

This article is the second in the series and is devoted to the type G_2. The work consists of two parts. In the first part we calculate the structure constants of the complex simple Lie algebra of type G_2. All structure constants are…

Group Theory · Mathematics 2023-12-27 Sergey G. Kolesnikov

We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.

Information Theory · Computer Science 2022-10-27 Mrinmoy Datta , Trygve Johnsen

The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for…

Information Theory · Computer Science 2013-08-01 Paul Cuff , Eva C. Song

We give an elementary and rigorous proof of the Thomae type formula for singular $Z_N$ curves. To derive the Thomae formula we use the traditional variational method which goes back to Riemann, Thomae and Fuchs.

Mathematical Physics · Physics 2015-10-14 Victor Enolskii , Tamara Grava

In this paper, we derive closed-form estimators for the parameters of some probability distributions belonging to the exponential family. A bootstrap bias-reduced version of these proposed closed-form estimators are also derived. A Monte…

Methodology · Statistics 2024-05-24 Roberto Vila , Eduardo Nakano , Helton Saulo

This paper works out the versions of the classical Giambelli and Pieri formulas in the context of quantum cohomology of a complex Grassmannian.

alg-geom · Mathematics 2008-02-03 Aaron Bertram

In this paper, we investigate new class of sequences related to fully degenerate Bernoulli numbers and polynomials. From those sequences, we derive some formulae for the degenerate Bernoulli and Euler polynomials.

Number Theory · Mathematics 2022-03-09 Taekyun Kim , Dae san Kim

Let $G$ be a group and $\alpha: G \times G \to G$ denote the commutator map. In the case of finite groups, Frobenius gave the formula to compute the cardinalities of the fibres $\alpha^{-1}(g)$ in terms of the character values $\chi(g)$ for…

Group Theory · Mathematics 2024-10-17 Shripad Garge , Uday Bhaskar Sharma

In this paper, we compute all possible Jordan types of linear forms $\ell$ in any full Perazzo algebra $A$. In some cases we are also able to compute the corresponding Jordan degree type, which is a finer invariant.

Commutative Algebra · Mathematics 2025-11-03 Pedro Macias Marques , Rosa M. Miró-Roig , Josep Pérez

We find presentations by generators and relations for the equivariant quantum cohomology of the Grassmannian. For these presentations, we also find determinantal formulae for the equivariant quantum Schubert classes. To prove this, we use…

Combinatorics · Mathematics 2007-05-23 Leonardo Constantin Mihalcea

We compute the E-polynomials of a family of twisted character varieties by proving they have polynomial count, and applying a result of N. Katz on the counting functions. To compute the number of GF(q)-points of these varieties as a…

Number Theory · Mathematics 2010-06-08 Martin Mereb

In this paper, we consider the degenerate poly-Bernoulli polynomials and present new and explicit formulas for computing them in terms of the degenerate Bernoulli polynomials and Stirling numbers of the second kind.

Number Theory · Mathematics 2015-03-31 Dae San Kim , Taekyun Kim

Jacobi-Trudy formula for a generalisation of Schur polynomials related to any sequence of orthogonal polynomials in one variable is given. As a corollary we have Giambelli formula for generalised Schur polynomials.

Representation Theory · Mathematics 2009-06-10 A. N. Sergeev , A. P. Veselov

The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x_1^n using the entropy of the k-block empirical probability and letting k grow with $n$ roughly like log n. We further assume that the…

Probability · Mathematics 2009-11-10 J. -R. Chazottes , D. Gabrielli

We present a uniform approach to the construction of the groups of type $\mathrm{E}_6$ over arbitrary fields without using Lie theory. This gives a simple description of the group generators and some of the subgroup structure. In the finite…

Group Theory · Mathematics 2024-04-16 John N. Bray , Yegor Stepanov , Robert A. Wilson

We compute the trivial source character tables (also called species tables of the trivial source ring) of the infinite family of finite groups SL(2,q) over a large enough field of positive characteristic $\ell$ via character-theoretical…

Representation Theory · Mathematics 2021-08-19 Bernhard Böhmler , Niamh Farrell , Caroline Lassueur

The aim of this paper is to investigate generating functions for modification of the Milne-Thomson's polynomials, which are related to the Bernoulli polynomials and the Hermite polynomials. By applying the Umbral algebra to these generating…

Classical Analysis and ODEs · Mathematics 2018-11-19 Rahime Dere , Yilmaz Simsek

The general expression for the bicovariant bracket for odd generators of the external algebra on a Poisson-Lie group is given. It is shown that the graded Poisson-Lie structures derived before for $GL(N)$ and $SL(N)$ are the special cases…

High Energy Physics - Theory · Physics 2009-10-28 G. E. Arutyunov , P. B. Medvedev

There are several reformulations of the Vi\`ete's formula for pi that have been reported in the modern literature. In this paper we show another analog to the Vi\`ete's formula for pi by Chebyshev polynomials of the first kind.

Number Theory · Mathematics 2016-09-20 S. M. Abrarov , B. M. Quine

Borell's formula is a stochastic variational formula for the log-Laplace transform of a function of a Gaussian vector. We establish an extension of this to the Riemannian setting and give a couple of applications, including a new proof of a…

Probability · Mathematics 2015-12-21 Joseph Lehec