相关论文: Indicator function and complex coding for mixed fr…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…

We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…

Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…

The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

The study of good nonregular fractional factorial designs has received significant attention over the last two decades. Recent research indicates that designs constructed from quaternary codes (QC) are very promising in this regard. The…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

The minimum aberration criterion has been frequently used in the selection of fractional factorial designs with nominal factors. For designs with quantitative factors, however, level permutation of factors could alter their geometrical…

Given a two-level regular fractional factorial design of resolution IV, the method of doubling produces another design of resolution IV which doubles both the run size and the number of factors of the initial design. On the other hand, the…

The research of developing a general methodology for the construction of good nonregular designs has been very active in the last decade. Recent research by Xu and Wong [Statist. Sinica 17 (2007) 1191--1213] suggested a new class of…

We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

Multilevel methods are among the most efficient numerical methods for solving large-scale systems of equations that arise from discretized partial differential equations. Two-level convergence theory plays a fundamental role in the analysis…

One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…

We show that many important convex matrix functions can be represented as the partial infimal projection of the generalized matrix fractional (GMF) and a relatively simple convex function. This representation provides conditions under which…