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

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Chen and Cheng [Ann. Statist. 34 (2006) 546--558] discussed the method of doubling for constructing two-level fractional factorial designs. They showed that for $9N/32\le n\le 5N/16$, all minimum aberration designs with $N$ runs and $n$…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

An inclusion of II$_1$ factors $N \subset M$ with finite Jones index gives rise to a powerful set of invariants that can be approached successfully in a number of different ways. We describe Jones' pictorial description of the standard…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Factorization machine (FM) variants are widely used for large scale real-time content recommendation systems, since they offer an excellent balance between model accuracy and low computational costs for training and inference. These systems…

We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…

The subject of this note is the mixed Katugampola fractional integral of a bivariate function defined on a rectangular region in the Cartesian plane. This is a natural extension of the Katugampola fractional integral of a univariate…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…

A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type" multi-point functions multiplied by simple weighting factors. The final integrations…

We consider the most general form of soft and collinear factorization for hard-scattering amplitudes to all orders in perturbative Quantum Chromodynamics. Specifically, we present the generalization of collinear factorization to…

We define new generalized factorials in several variables over an arbitrary subset $\underline{S} \subseteq R^n,$ where $R$ is a Dedekind domain and $n$ is a positive integer. We then study the properties of the fixed divisor…

This paper studies properties of the integer sequence $\overline{\overline{G}}_n=\prod_{k=0}^n\binom{n}{k}_{\mathbb{Z},\mathbb{N}}$ which is analogous to $\overline{G}_n=\prod_{k=0}^n\binom{n}{k}$, the product of the elements of the $n$-th…

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

Quaternary code (QC) designs form an attractive class of nonregular factorial fractions. We develop a complementary set theory for characterizing optimal QC designs that are highly fractionated in the sense of accommodating a large number…

We give iterative constructions for irreducible polynomials over F_q of degree nt^r for all nonnegative integers r, starting from irreducible polynomials of degree n. The iterative constructions correspond modulo fractional linear…

In this paper we study saturated fractions of factorial designs under the perspective of Algebraic Statistics. We define a criterion to check whether a fraction is saturated or not with respect to a given model. The proposed criterion is…

An explicit formula is obtained for the generalized Macdonald functions on the $N$-fold Fock tensor spaces, calculating a certain matrix element of a composition of several screened vertex operators. As an application, we prove the…