English
Related papers

Related papers: Flagged Littlewood-Richardson tableaux and branchi…

200 papers

In this paper, we develop via real variable methods various characterisations of the Hardy spaces in the multi-parameter flag setting. These characterisations include those via, the non-tangential and radial maximal function, the…

Classical Analysis and ODEs · Mathematics 2020-06-30 Yongsheng Han , Ming-Yi Lee , Ji Li , Brett D. Wick

We study weighted boundedness of Hardy-Littlewood-type maximal function involving Orlicz functions. We also obtain some sufficient conditions for the weighted boundedness of the Hardy-Littlewood maximal function of the upper-half plane.

Classical Analysis and ODEs · Mathematics 2017-02-13 Benoît F. Sehba

Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…

Combinatorics · Mathematics 2018-02-23 Oleg Pikhurko , Jakub Sliacan , Konstantinos Tyros

We prove several Littlewood-Offord type inequalities for arbitrary groups. In groups having elements of finite order the worst case scenario is provided by the simple random walk on a certain cyclic subgroup. The inequalities we obtain are…

Probability · Mathematics 2021-11-30 T. Juškevičius , G. Šemetulskis

We present three different upper bounds for Kronecker coefficients $g(\lambda,\mu,\nu)$ in terms of Kostka numbers, contingency tables and Littlewood--Richardson coefficients. We then give various examples, asymptotic applications, and…

Combinatorics · Mathematics 2020-03-27 Igor Pak , Greta Panova

In this paper we study the Gan-Gross-Prasad problem for finite classical groups. Our results provide complete answers for unipotent representations, and we obtain the explicit branching laws for these representations. Moreover, for…

Representation Theory · Mathematics 2021-11-19 Zhicheng Wang

We obtain new combinatorial formulae for modified Hall--Littlewood polynomials, for matrix elements of the transition matrix between the elementary symmetric functions and Hall-Littlewood's ones, and for the number of rational points over…

Quantum Algebra · Mathematics 2007-05-23 Anatol N. Kirillov

The Lagrangian and Hamiltonian structures for an ideal gauge-charged fluid are determined. Using a Kaluza-Klein point of view, the equations of motion are obtained by Lagrangian and Poisson reductions associated to the automorphism group of…

Mathematical Physics · Physics 2009-03-26 François Gay-Balmaz , Tudor S. Ratiu

We prove a general combinatorial formula yielding the intersection number $c_{u,v}^w$ of three particular $\Lambda$-minuscule Schubert classes in any Kac-Moody homogeneous space, generalising the Littlewood-Richardson rule. The…

Algebraic Geometry · Mathematics 2009-02-04 Pierre-Emmanuel Chaput , Nicolas Perrin

We reformulate the Hamiltonian approach to lattice gauge theories such that, at the classical level, the gauge group does not act canonically, but instead as a Poisson-Lie group. At the quantum level, it then gets promoted to a quantum…

High Energy Physics - Theory · Physics 2014-11-18 G. Bimonte , A. Stern , P. Vitale

The multiplicative Newton-like method developed by the author et al. is extended to the situation where the dynamics is restricted to the orthogonal group. A general framework is constructed without specifying the cost function. Though the…

Machine Learning · Computer Science 2007-05-23 Toshinao Akuzawa

For classical groups SL(n), SO(n) and Sp(2n), we define uniformly geometric valuations on the corresponding complete flag varieties. The valuation in every type comes from a natural coordinate system on the open Schubert cell and is…

Algebraic Geometry · Mathematics 2019-02-08 Valentina Kiritchenko

Explicit combinatorial cancellation-free rules are given for the product of an equivariant line bundle class with a Schubert class in the torus-equivariant K-theory of a Kac-Moody flag manifold. The weight of the line bundle may be dominant…

Combinatorics · Mathematics 2012-03-16 Cristian Lenart , Mark Shimozono

We introduce coplactic raising and lowering operators $E'_i$, $F'_i$, $E_i$, and $F_i$ on shifted skew semistandard tableaux. We show that the primed operators and unprimed operators each independently form type A Kashiwara crystals (but…

Combinatorics · Mathematics 2017-11-21 Maria Gillespie , Jake Levinson , Kevin Purbhoo

Let mathcal{O}_lambda be a generic coadjoint orbit of a compact semi-simple Lie group K. Weight varieties are the symplectic reductions of mathcal{O}_lambda by the maximal torus T in K. We use a theorem of Tolman and Weitsman to compute the…

Symplectic Geometry · Mathematics 2007-05-23 R. F. Goldin , A. -L. Mare

We generalise partial results about the Yau-Tian-Donaldson correspondence on ruled manifolds to bundles whose fibre is a classical flag variety. This is done using Chern class computations involving the combinatorics of Schur functors. The…

Algebraic Geometry · Mathematics 2015-11-11 Anton Isopoussu

For a given skew shape, we build a crystal graph on the set of all reverse plane partitions that have this shape. As a consequence, we get a simple extension of the Littlewood-Richardson rule for the expansion of the corresponding dual…

Combinatorics · Mathematics 2017-07-11 Pavel Galashin

We show that the spontaneous breaking of center symmetry can be avoided on a $L^2\times 1^2$ lattice with the appropriate choice of twisted boundary conditions. In order for this to work it is crucial that the twisted boundary conditions…

High Energy Physics - Lattice · Physics 2015-11-03 Liam Keegan , Alberto Ramos

We consider a class of weighted harmonic functions in the open upper half-plane known as $\alpha$-harmonic functions. Of particular interest is the uniqueness problem for such functions subject to a vanishing Dirichlet boundary value on the…

Analysis of PDEs · Mathematics 2025-01-03 Anders Olofsson , Jens Wittsten

Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…

Information Theory · Computer Science 2008-07-01 Salim Y. El Rouayheb , C. N. Georghiades , E. Soljanin , A. Sprintson