English
Related papers

Related papers: A straightening algorithm for row-convex tableaux

200 papers

We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load…

Data Structures and Algorithms · Computer Science 2010-06-02 Zoya Svitkina , Lisa Fleischer

We review some recent advances in modular representation theory of symmetric groups and related Hecke algebras. We discuss connections with Khovanov-Lauda-Rouquier algebras and gradings on the blocks of the group algebras $F\Sigma_n$, which…

Representation Theory · Mathematics 2014-05-15 Alexander Kleshchev

Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…

Representation Theory · Mathematics 2018-10-30 Megan Ly

In a previous paper I have defined a new basis for the representation ring of a Weyl group. In this paper we show that the new basis is related to the standard basis by an upper triangular unipotent matrix. We also give a new…

Representation Theory · Mathematics 2019-07-09 G. Lusztig

In this paper we construct full support character sheaves for stably graded Lie algebras. Conjecturally these are precisely the cuspidal character sheaves. Irreducible representations of Hecke algebras associated to complex reflection…

Representation Theory · Mathematics 2025-03-25 Kari Vilonen , Ting Xue

Using a left-to-right "sweeping" algorithm, we define the \emph{Gauche basis} for the column space of a matrix $M$. By means of the Gauche basis we interpret the row reduced echelon form of $M$, and give a direct proof of its uniqueness. We…

General Mathematics · Mathematics 2021-04-16 Eric L. Grinberg

Linear algebraic expressions are the essence of many computationally intensive problems, including scientific simulations and machine learning applications. However, translating high-level formulations of these expressions to efficient…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-03-22 Dániel Berényi , András Leitereg , Gábor Lehel

Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…

Rings and Algebras · Mathematics 2009-03-31 Birgit Reinert

We propose a method that allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. This method is presented in the framework…

Logic in Computer Science · Computer Science 2015-01-08 Mélanie Jacquel , Karim Berkani , David Delahaye , Catherine Dubois

Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…

Symbolic Computation · Computer Science 2019-02-04 Matías Bender , Jean-Charles Faugère , Elias Tsigaridas

Using combinatorial properties of symmetric polynomials, we compute explicitly the Soergel modules for some permutations whose corresponding Schubert varieties are rationally smooth. We build from them diagram algebras whose module…

Representation Theory · Mathematics 2013-11-28 Antonio Sartori

The Lusztig-Shoji algorithm is generalized to a complex reflection group $W$ and give us a version of the Springer correspondence of $W$. We show that the combinatorics of generalized Springer correspondences of dihedral groups of order…

Representation Theory · Mathematics 2023-11-30 Susumu Higuchi

Inspired by recent work on convex formulations of clustering (Lashkari & Golland, 2008; Nowozin & Bakir, 2008) we investigate a new formulation of the Sparse Coding Problem (Olshausen & Field, 1997). In sparse coding we attempt to…

Machine Learning · Computer Science 2012-05-14 David M. Bradley , J Andrew Bagnell

We consider radial complex scaling/perfectly matched layer methods for scalar resonance problems in homogeneous exterior domains. We introduce a new abstract framework to analyze the convergence of domain truncations and discretizations.…

Numerical Analysis · Mathematics 2020-07-21 Martin Halla

The Springer correspondence makes a link between the characters of a Weyl group and the geometry of the nilpotent cone of the corresponding semisimple Lie algebra. In this article, we consider a modular version of the theory, and show that…

Representation Theory · Mathematics 2014-10-07 Daniel Juteau

Flagged Schur modules generalize the irreducible representations of the general linear group under the action of the Borel subalgebra. Their characters include many important generalizations of Schur polynomials, such as Demazure…

Combinatorics · Mathematics 2020-12-11 Sam Armon , Sami Assaf , Grant Bowling , Henry Ehrhard

This paper extends a recently proposed robust computational framework for constructing the boundary representation (brep) of the volume swept by a given smooth solid moving along a one parameter family $h$ of rigid motions. Our extension…

Graphics · Computer Science 2014-05-30 Bharat Adsul , Jinesh Machchhar , Milind Sohoni

In this paper all of the classical constructions of A. Young are generalized to affine Hecke algebras of type A. It is proved that the calibrated irreducible representations of the affine Hecke algebra are indexed by placed skew shapes and…

Representation Theory · Mathematics 2007-05-23 Arun Ram

We present a formulas to add a row or a column to the power, monomial, forgotten, Schur, homogeneous and elementary symmetric functions. As an application of these operators we show that the operator that adds a column to the Schur…

Combinatorics · Mathematics 2007-05-23 Mike Zabrocki

We develop and study the generalization of rational Schur algebras to the super setting. Similar to the classical case, this provides a new method for studying rational supermodules of the general linear supergroup $GL(m|n)$. Furthermore,…

Representation Theory · Mathematics 2024-05-30 Andrew Riesen
‹ Prev 1 3 4 5 6 7 10 Next ›