English
Related papers

Related papers: X=M Theorem: Fermionic formulas and rigged configu…

200 papers

Relying upon the division-algebra classification of Clifford algebras and spinors, a classification of generalized supersymmetries (or, with a slight abuse of language,"generalized supertranslations") is provided. In each given space-time…

High Energy Physics - Theory · Physics 2008-11-26 Francesco Toppan

A conjectured finite M-theory based on eleven-dimensional supergravity formulated in a superspace with a non-anticommutative <>-product of field operators is proposed. Supermembranes are incorporated in the superspace <>-product formalism.…

High Energy Physics - Theory · Physics 2007-05-23 J. W. Moffat

Several complementary approaches to investigate knotted solutions of Maxwell's equations in vacuum are now available in literature. However, only partial results towards a unified description of them have been achieved. This is potentially…

Mathematical Physics · Physics 2020-04-13 E. Goulart , J. E. Ottoni

Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of the extremal construction. In the present paper we study…

Combinatorics · Mathematics 2024-11-13 Richard P. Anstee , Benjamin Kreiswirth , Bowen Li , Attila Sali , Jaehwan Seok

The $X=M$ conjecture asserts that the $1D$ sum and the fermionic formula coincide up to some constant power. In the case of type $A,$ both the $1D$ sum and the fermionic formula are closely related to Kostka polynomials. Double Kostka…

Quantum Algebra · Mathematics 2016-03-01 Shiyuan Liu

The staggered fermion approach to build models with chiral fermions is briefly reviewed. The method is tested in a U(1) model with axial vector coupling in two and four dimensions.

High Energy Physics - Lattice · Physics 2009-10-22 W. Bock , J. Smit , J. C. Vink

Let M be a connected sum of finitely many lens spaces, and let N be a connected sum of finitely many copies of S^1xS^2. We show that there is a uniruled algebraic variety X such that the connected sum M#N of M and N is diffeomorphic to a…

Algebraic Geometry · Mathematics 2009-03-31 Johannes Huisman , Frédéric Mangolte

Let $\mathcal{M}$ be a type ${\rm II_1}$ factor and let $\tau$ be the faithful normal tracial state on $\mathcal{M}$. In this paper, we prove that given an $X \in \mathcal{M}$, $X=X^*$, then there is a decomposition of the identity into $N…

Operator Algebras · Mathematics 2021-05-18 Xinyan Cao , Junsheng Fang , Zhaolin Yao

We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a "near" proof of the fact that this is the case unconditionally, and a complete conditional…

Number Theory · Mathematics 2014-03-24 Kevin Ford , Florian Luca

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

Combinatorics · Mathematics 2025-10-02 Nived J M

In this paper we investigate the general combinatorical structure of the truth tables of all bracketed formulae with n distinct variables connected by the binary connective of implication, an m-implication.

Combinatorics · Mathematics 2015-03-20 Volkan Yildiz

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…

Logic · Mathematics 2019-02-20 Vera Koponen

Repeated integration is a major topic of integral calculus. In this article, we study repeated integration. In particular, we study repeated integrals and recurrent integrals. For each of these integrals, we develop reduction formulae for…

General Mathematics · Mathematics 2022-06-14 Roudy El Haddad

This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…

Commutative Algebra · Mathematics 2016-03-15 Takuro Abe

A new fermionic formula for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ is presented. This formula is different from the one given by Hatayama et al. and is valid for all crystal paths based on Kirillov-Reshetihkin modules,…

Combinatorics · Mathematics 2013-12-19 Lipika Deka , Anne Schilling

In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…

Combinatorics · Mathematics 2023-08-02 Oliver Pechenik , Travis Scrimshaw

A formula expressing the fermionic determinant (a large order polynomial) as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and…

High Energy Physics - Lattice · Physics 2016-11-03 Ion-Olimpiu Stamatescu , Erhard Seiler

Recently, a birational representation of an extended affine Weyl group of type $A_{mn-1}^{(1)}\times A_{m-1}^{(1)}\times A_{m-1}^{(1)}$ was proposed with the aid of a cluster mutation. In this article we formulate this representation in a…

Exactly Solvable and Integrable Systems · Physics 2021-12-08 Takao Suzuki

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

Combinatorics · Mathematics 2024-03-07 Kevin Purbhoo

Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…

Combinatorics · Mathematics 2011-10-05 Mike Develin , Jeremy L. Martin , Victor Reiner