English
Related papers

Related papers: Super RSK correspondence with symmetry

200 papers

An attempt is made to present modern hopes to find manifestation of supersymmetry, a new symmetry that relates bosons and fermions, in particle physics from the point of view of renormalization group flow. The Standard Model of particle…

High Energy Physics - Phenomenology · Physics 2009-09-25 D. I. Kazakov

Within the framework of supersymmetry, the particle content is extended in a way that each Higgs doublet is in a full generation. Namely in addition to ordinary three generations, there is an extra vector-like generation, and it is the…

High Energy Physics - Phenomenology · Physics 2010-04-30 Chun Liu

In this paper we show that the irreducible representations of a finite inverse semigroup $S$ over an algebraically closed field $F$ are in bijection with the conjugacy classes of $S$ if the characteristic of $F$ is zero or a prime number…

Representation Theory · Mathematics 2012-08-29 Zhenheng Li , Zhuo Li

Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…

Computer Vision and Pattern Recognition · Computer Science 2024-04-04 Maolin Gao , Zorah Lähner , Johan Thunberg , Daniel Cremers , Florian Bernard

We prove a Schoenberg-type correspondence for non-unital semigroups which generalizes an analogous result for unital semigroup proved by Michael Sch\"urmann. It characterizes the generators of semigroups of linear maps on $M_n(C)$ which are…

Functional Analysis · Mathematics 2023-09-06 B. V. Rajarama Bhat , Purbayan Chakraborty , Uwe Franz

The Shi arrangement ${\mathcal S}_n$ is the arrangement of affine hyperplanes in ${\mathbb R}^n$ of the form $x_i - x_j = 0$ or $1$, for $1 \leq i < j \leq n$. It dissects ${\mathbb R}^n$ into $(n+1)^{n-1}$ regions, as was first proved by…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis , Svante Linusson

In a recent paper, Ayyer and Behrend present for a wide class of partitions factorizations of Schur polynomials with an even number of variables where half of the variables are the reciprocals of the others into symplectic and/or orthogonal…

Combinatorics · Mathematics 2020-03-31 Arvind Ayyer , Ilse Fischer

We interpret a counterexample to Hilbert's 14th problem by S. Kuroda geometrically in two ways: As ring of regular functions on a smooth rational quasiprojective variety over any field K of characteristic 0, and, in the special case where K…

Algebraic Geometry · Mathematics 2013-01-01 Sebastian Krug

An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…

Combinatorics · Mathematics 2025-03-19 Michael Anastos , Zhihan Jin , Matthew Kwan , Benny Sudakov

Associated with the $r$-Shi arrangement and $r$-Catalan arrangement in $\Bbb{R}^n$, we introduce a cubic matrix for each region to establish two bijections in a uniform way. Firstly, the positions of minimal positive entries in column…

Combinatorics · Mathematics 2020-05-19 Houshan Fu , Suijie Wang , Weijin Zhu

We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.

Logic · Mathematics 2007-05-23 Raf Cluckers

In this paper we describe the mathematical foundations of a new approach to semi-supervised Machine Learning. Using techniques of Symbolic Computation and Computer Algebra, we apply the concept of persistent homology to obtain a new…

Machine Learning · Computer Science 2023-01-30 Adrián Inés , César Domínguez , Jónathan Heras , Gadea Mata , Julio Rubio

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…

Combinatorics · Mathematics 2018-09-20 Vasu Tewari , Stephanie van Willigenburg

We introduce and address the problem of ad hoc table retrieval: answering a keyword query with a ranked list of tables. This task is not only interesting on its own account, but is also being used as a core component in many other…

Information Retrieval · Computer Science 2018-03-09 Shuo Zhang , Krisztian Balog

In this research a new algebraic semantics of rough set theory including additional meta aspects is proposed. The semantics is based on enhancing the standard rough set theory with notions of 'relative ability of subsets of approximation…

Logic · Mathematics 2007-05-23 A. Mani

We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…

Combinatorics · Mathematics 2021-05-18 Zachary Hamaker , Alejandro H. Morales , Igor Pak , Luis Serrano , Nathan Williams

Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…

Complex Variables · Mathematics 2011-10-20 John P. D'Angelo , Jiri Lebl

Session types statically prescribe bidirectional communication protocols for message-passing processes. However, simple session types cannot specify properties beyond the type of exchanged messages. In this paper we extend the type system…

Programming Languages · Computer Science 2020-05-14 Ankush Das , Frank Pfenning

General potential theories concern the study of functions which are subharmonic with respect to a suitable constraint set (called a subequation) in the space of 2-jets. While interesting in their own right, general potential theories are…

Analysis of PDEs · Mathematics 2025-09-18 F. Reese Harvey , Kevin R. Payne

We study the complexity of approximating solution structure of the bijective weighted sentence alignment problem of DeNero and Klein (2008). In particular, we consider the complexity of finding an alignment that has a significant overlap…

Computation and Language · Computer Science 2014-09-09 Antonina Kolokolova , Renesa Nizamee