相关论文: Extraspecial pairs in the multiply-laced root syst…

Explaining why and how a tree $t$ structurally differs from another tree $t^\star$ is a question that is encountered throughout computer science, including in understanding tree-structured data such as XML or JSON data. In this article, we…

We construct a Lax pair for the $E^{(1)}_6 $ $q$-Painlev\'e system from first principles by employing the general theory of semi-classical orthogonal polynomial systems characterised by divided-difference operators on discrete, quadratic…

The purpose of this present paper is to investigate the geometric structure of regular overdetermined systems of second order with two independent and one dependent variables from the point of view of rank 2 prolongations. Utilizing this…

The Kochen-Specker theorem states that a 3-dimensional complex Euclidean space admits a finite configuration of projective lines such that the corresponding quantum observables (the orthogonal projectors) cannot be assigned with 0 and 1…

Let $A_{3}(n)$ (resp. ${{B}_{3}}(n)$) denote the number of partition pairs (resp. triples) of $n$ where each partition is 3-core. By applying Ramanujan's ${}_{1}\psi_{1}$ formula and Bailey's ${}_{6}\psi_{6}$ formula, we find the explicit…

In this paper some combinatorial and homological tools are used to describe and give an explicit formula for the number of exceptional pairs (exceptional sequences of length two) for some classes of Nakayama Algebras and for the Auslander…

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e.,…

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

We define the notion of a Catalan pair (which is a pair of binary relations (S,R) satisfying certain axioms) with the aim of giving a common language to most of the combinatorial interpretations of Catalan numbers. We show, in particular,…

Given a root system $R$, two roots are said to be \emph{strongly orthogonal} if neither their sum nor difference is a root. Gashi defined a family of graphs with vertices labelled by sums of $k$-element strongly orthogonal subsets of roots,…

For a set $E \subseteq \mathbb{F}_q^d$, the distance set is defined as $\Delta(E) := \{\|\mathbf{x} - \mathbf{y}\| : \mathbf{x}, \mathbf{y} \in E\}$, where $\|\cdot\|$ denotes the standard quadratic form. We investigate the…

We study the four-dimensional superconformal N=2 gauge theories engineered by the Type IIB superstring on Arnold's 14 exceptional unimodal singularities (a.k.a. Arnold's strange duality list), thus extending the methods of 1006.3435 to…

We compute the Poisson bracket relations for the monodromy matrix of the auxiliary linear problem. If the basic Poisson bracket relations of the model contain derivatives, this computation leads to a peculiar type of symmetry breaking which…

We compute the Schur indices in the presence of some line operators based on our con- jectural formula introduced in [1]. In particular, we focus on the rank 1 superconformal field theories with the enhanced global symmetry and the free…

Systems-conjugate points have been introduced and studied by John Barrett \cite{barr} in relation with the self-adjoint fourth order differential equation $$(r(x)y")"-(q(x)y')'= p(x)y,$$ where $r(x)>0$, $p(x)>0$ and $q\equiv0$. In this…

In the present paper we construct differential invariants for generic rank 2 vector distributions on n-dimensional manifold. In the case n=5 (the first case containing functional parameters) E. Cartan found in 1910 the covariant…

We show the uniqueness and existence of the Euler form for a simply-laced generalized root system. This enables us to show that the Coxeter element for a simply-laced generalized root system is admissible in the sense of R.~W.~Carter. As an…

We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…

In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…