Related papers: The Combinatorics of Weighted Vector Compositions
In this paper we study the coefficients of the powers of an ordinary generating function and their properties. A new class of functions based on compositions of an integer $n$ is introduced and is termed composita. We present theorems about…
A toric hyperplane is the preimage of a point $x \in S^1$ of a continuous surjective group homomorphism $\theta: \mathbb{T}^n \to S^1$. A finite hyperplane arrangement is a finite collection of such hyperplanes. In this paper, we study the…
In this note unbounded hyperexpansive weighted composition operators are investigated. AS a consequence unbounded hyperexpansive multiplication and composition operators are characterized.
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
In compositional data analysis an observation is a vector containing non-negative values, only the relative sizes of which are considered to be of interest. Without loss of generality, a compositional vector can be taken to be a vector of…
In the multiple linear regression setting, we propose a general framework, termed weighted orthogonal components regression (WOCR), which encompasses many known methods as special cases, including ridge regression and principal components…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In…
We develop a practical method to analyze the mixing structure of hadrons consisting of two components of quark-composite and hadronic composite. As an example we investigate the properties of the axial vector meson a1(1260) and discuss its…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
A {\it vector space partition} is here a collection $\mathcal P$ of subspaces of a finite vector space $V(n,q)$, of dimension $n$ over a finite field with $q$ elements, with the property that every non zero vector is contained in a unique…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
Given multiple source word embeddings learnt using diverse algorithms and lexical resources, meta word embedding learning methods attempt to learn more accurate and wide-coverage word embeddings. Prior work on meta-embedding has repeatedly…
In quantum theory, a weak value is a complex number with a somewhat technical definition: it is a ratio whose numerator is the matrix element of a self-adjoint operator and whose denominator is the inner product of a corresponding pair of…
Given complex numbers $w_1, \ldots, w_n$, we define the weight $w(X)$ of a set $X$ of 0-1 vectors as the sum of $w_1^{x_1} \cdots w_n^{x_n}$ over all vectors $(x_1, \ldots, x_n)$ in $X$. We present an algorithm, which for a set $X$ defined…
Integer compositions with certain colored parts were introduced by Andrews in 2007 to address a number-theoretic problem. Integer compositions allowing zero as some parts were introduced by Ouvry and Polychronakos in 2019. We give a…
The main goal of this paper is to present the application of structural sums, mathematical objects originating from the computational materials science, in construction of a feature space vector of 2D random composites simulated by…
Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…
In this paper we consider well-posedness properties of vector optimization problems with objective function $f: X \to Y$ where $X$ and $Y$ are Banach spaces and $Y$ is partially ordered by a closed convex pointed cone with nonempty…
Lexicographic composition is a natural way to build an aggregate choice function from component choice functions. As the name suggests, the components are ordered and choose sequentially. The sets that subsequent components select from are…