Related papers: On a generalization of Kelly's combinatorial lemma

Let $n\geq 1$ and $X_{n}$ be the random variable representing the size of the smallest component of a random combinatorial object made of $n$ elements. A combinatorial object could be a permutation, a monic polynomial over a finite field, a…

Using methods developed by Robinson, we find a complete theory suitable for a first order description of infintesimal neighborhoods. We use this to construct a specialisation having universal properties and to find a recursively enumerable…

Let $A$ be a regular ring of dimension $\le 2$. Let $G$ be a reductive group over $A$ such that its derived group is a split, i.e. a Chevalley--Demazure, semisimple group. We prove that every Zariski-locally trivial principal $G$-bundle…

The K-theoretic quiver component formula expresses the K-polynomial of a type A quiver locus as an alternating sum of products of double Grothendieck polynomials. This formula was conjectured by A. Buch and R. Rim\'anyi and later proved by…

We construct relative and global Euler sequences of a module. We apply it to prove some acyclicity results of the Koszul complex of a module and to compute the cohomology of the sheaves of (relative and absolute) differential $p$-forms of a…

A combinatorial study of multiple $q$-integrals is developed. This includes a $q$-volume of a convex polytope, which depends upon the order of $q$-integration. A multiple $q$-integral over an order polytope of a poset is interpreted as a…

In the representation theory of finite-dimensional algebras, the study of projective presentations of maximal rank is closely related to the study of generically $\tau$-regular irreducible components of varieties of modules over such…

Suppose $\mathbb{K}$ is a large enough field and $\mathcal{P} \subset \mathbb{K}^2$ is a fixed, generic set of points which is available for precomputation. We introduce a technique called \emph{reshaping} which allows us to design…

Integrals involving derivatives of Legendre polynomials frequently arise in applications ranging from multipole expansions for processes involving electromagnetic probes to spectral methods in numerical physics. Despite their practical…

We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…

In the area of inductive learning, generalization is a main operation, and the usual definition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine…

In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…

In previous work, the authors introduced the notion of Q-Koszul algebras, as a tool to "model" module categories for semisimple algebraic groups over fields of large characteristics. Here we suggest the model extends to small…

We show how the classical Moser Lemma from symplectic geometry extends to generalized complex structures (GCS) on arbitrary Courant algebroids. For this, we extend the notion of Lie derivative to sections of the tensor bundle $(\otimes^i…

We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…

Let $W$ be a Coxeter group, and for $u,v\in W$, let $R_{u,v}(q)$ be the Kazhdan-Lusztig $R$-polynomial indexed by $u$ and $v$. In this paper, we present a combinatorial proof of the inversion formula on $R$-polynomials due to Kazhdan and…

In this paper we consider several generalizations of the Borsuk-Ulam theorem for G-spaces and apply these results to Tucker type lemmas for G-simplicial complexes and PL-manifolds.

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…

In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas…