相关论文: Hilbert Bases for Orthogonal Arrays

This article discusses some difficulties in the implementation of combinatorial algorithms associated with the choice of all elements with certain properties among the elements of a set with great cardinality.The problem has been resolved…

Using vertex algebra techniques, we determine a set of generators for the cohomology ring of the Hilbert schemes of points on an arbitrary smooth projective surface over the field of complex numbers.

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

In this paper we present a new algorithm for solving linear programs that requires only $\tilde{O}(\sqrt{rank(A)}L)$ iterations to solve a linear program with $m$ constraints, $n$ variables, and constraint matrix $A$, and bit complexity…

This paper explores the use of "generated sets" $\{ \{ k \boldsymbol{\zeta} \} : k = 1, \ldots, n \}$ for function approximation in reproducing kernel Hilbert spaces which consist of multi-dimensional functions with an absolutely convergent…

We present algorithms for length-constrained maximum sum segment and maximum density segment problems, in particular, and the problem of finding length-constrained heaviest segments, in general, for a sequence of real numbers. Given a…

This is a noncommutative version of the previous work entitled "Deformation Expression for Elements of Algebras (I)." In general in a noncommutative algebra, there is no canonical way to express elements in univalent way, which is often…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…

Hilbert's 14th problem studies the finite generation property of the intersection of an integral algebra of finite type with a subfield of the field of fractions of the algebra. It has a negative answer due to the counterexample of Nagata.…

A long-standing open question asks for the minimum number of vectors needed to form an unextendible product basis in a given bipartite or multipartite Hilbert space. A partial solution was found by Alon and Lovasz in 2001, but since then…

Let $H:M_m\to M_m$ be a holomorphic function of the algebra $M_m$ of complex $m\times m$ matrices. Suppose that $H$ is orthogonally additive and orthogonally multiplicative on self-adjoint elements. We show that either the range of $H$…

Orthogonal arrays play a fundamental role in many applications. However, constructing orthogonal arrays with the required parameters for an application usually is extremely difficult and, sometimes, even impossible. Hence there is an…

We develop a general recipe for constructing orthogonal bases for the calculation of color structures appearing in QCD for any number of partons and arbitrary Nc. The bases are constructed using hermitian gluon projectors onto irreducible…

In this paper we introduce a new class of partially filled arrays that, as Heffter arrays, are related to difference families, graph decompositions and biembeddings. A non-zero sum Heffter array $\mathrm{N}\mathrm{H}(m,n; h,k)$ is an $m…

This paper presents a methodology to construct a divergence-free polynomial basis of an arbitrary degree in a simplex (triangles in 2D and tetrahedra in 3D) of arbitrary dimension. It allows for fast computation of all numerical solutions…

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

Riemann-Hilbert problems are jump problems for holomorphic functions along given interfaces. They arise in various contexts, e.g. in the asymptotic study of certain nonlinear partial differential equations and in the asymptotic analysis of…

The various ways to reduce number of vectors describing condition of particles for high energy physics problems are presented. In particular decomposition of any vector with respect to the basis, consisting of any four linearly independent…

This paper establishes robust obstructions to representing Hamiltonian diffeomorphisms as $k$-th powers ($k \geq 2$) or embedding them in flows for certain higher-dimensional symplectic manifolds $(M,\omega)$, including surface bundles. We…