Related papers: Submodular functions in additive combinatorics pro…
First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…
We consider the problem of minimising functions represented as a difference of lattice submodular functions. We propose analogues to the SupSub, SubSup and ModMod routines for lattice submodular functions. We show that our…
The variant of calculation of functions of set and their application is offered. In particular: the new measure of system of sets generalizing classical concept of a measure is entered; the variation of set that has allowed to construct a…
A subgroup $H$ of a finite group $G$ is submodular in $G$ if there is a subgroup chain $H=H_0\leq\ldots\leq H_i\leq H_{i+1}\leq \ldots \leq H_n=G$ such that $H_i$ is a modular subgroup of $H_{i+1}$ for every $i$. We investigate finite…
We give a precise, computable formula for comparing $\lambda$-invariants between modular forms in the anticyclotomic indefinite setting where the Selmer groups have positive rank. This is an improvement of Hatley-Lei \cite{HL19, HL21} where…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
A finite subgroup of $GL(n,\mathbb C)$ is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group. A uniform combinatorial model is constructed for all…
A function in a class $\mathcal{F}(X)$ is said to be subdifferentially determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any function in $\mathcal{F}(X)$ with the same subdifferential. A function is said to be…
We establish quasimodularity for a family of residual crank generating functions defined on overpartitions. We also show that the second moments of these $k$th residual cranks admit a combinatoric interpretation as weighted overpartition…
Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.
We study the operator-valued positive definite functions on a group using positive block matrices. We give an alternative proof to Brehmer positivity for doubly commuting contractions. We classify all commuting unitary representations over…
The main result of this article is an application of the theory of invariant convex cones of Lie algebras to the study of unitary representations of Lie supergroups. It also includes an exposition of recent results of the second author on…
We define basic notions in the category of conic representations of a topological group and prove elementary facts about them. We show that a conic representation determines an ordinary dynamical system of the group together with a…
Support $\tau$-tilting modules correspond to some classes of categorical objects bijectively, such as two-term tilting complexes for any finite dimensional symmetric algebra. This fact motivates us to classify support $\tau$-tilting modules…
The binary products of right, left or double division in semigroups that are semilattices of groups give interesting groupoid structures that are in one to one correspondence with semigroups that are semilattices of groups. This work is…
We present the basic elements of a generalization of symmetric function theory involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under…
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…
For a group $G$ acting over a set $X$, the set of all the $G$-equivariant functions, i.e., the set of functions which conmute with the action, ($g\cdot f(x)=g\cdot f(x), \forall g\in G, \forall x\in X$), is a monoid with the composition.…
En esta serie de tres articulos, damos una exposicion de varios resultados y problemas abiertos en tres areas de la combinatoria algebraica y geometrica: las matrices totalmente no negativas, las representaciones del grupo simetrico, y los…
A set label disagreement function is defined over the number of variables that deviates from the dominant label. The dominant label is the value assumed by the largest number of variables within a set of binary variables. The submodularity…