相关论文: Hilbert Bases for Orthogonal Arrays
Let $(S,p)$ be a smooth pointed surface. In the first part of this paper we study motivic invariants of punctual nested Hilbert schemes attached to $(S,p)$ using the Hilbert-Samuel stratification. We compute two infinite families of motivic…
The MinRank problem is a simple linear algebra problem: given matrices with coefficients in a field, find a non trivial linear combination of the matrices that has a small rank. There are several algebraic modeling of the problem. The main…
In 1978 Erd\H os asked if every sufficiently large set of points in general position in the plane contains the vertices of a convex $k$-gon, with the additional property that no other point of the set lies in its interior. Shortly after,…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
In this paper, we give an algorithm for finding general rational solutions of a given first-order ODE with parametric coefficients that occur rationally. We present an analysis, complete modulo Hilbert's irreducibility problem, of the…
In this short note we use the notion of power structure over the Grothendieck ring of complex algebraic varieties to study generating series of classes of Hilbert schemes of points on complex orbifolds.
In this paper we propose a simple and efficient strategy to obtain a data structure generator to accomplish a perfect hash of quite general order restricted multidimensional arrays named {\em phormas}. The constructor of such objects gets…
This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…
Given a metric space $(X,d)$, a set $S\subseteq X$ is called a $k$-\emph{metric generator} for $X$ if any pair of different points of $X$ is distinguished by at least $k$ elements of $S$. A $k$-\emph{metric basis} is a $k$-metric generator…
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…
In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coefficient functions. For this purpose we construct a generalized finite element basis that spans…
We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a…
Finding all the mutually unbiased bases in various dimensions is a problem of fundamental interest in quantum information theory and pure mathematics. The general problem formulated in finite-dimensional Hilbert spaces is open. In the…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the…
In the interest of finding the minimum additive generating set for the set of $\boldsymbol{s}$-lecture hall partitions, we compute the Hilbert bases for the $\boldsymbol{s}$-lecture hall cones in certain cases. In particular, we compute the…
Given a Hilbert space and the generator of a strongly continuous group on this Hilbert space. If the eigenvalues of the generator have a uniform gap, and if the span of the corresponding eigenvectors is dense, then these eigenvectors form a…
We consider the 2-generated free metabelian associative and Lie algebras over the complex field and the invariants of the dihedral groups of finite order acting on these algebras. In the associative case we find a finite set of generators…
We consider the algorithmic problem of generating each subset of $[n]:=\{1,2,\ldots,n\}$ whose size is in some interval $[k,l]$, $0\leq k\leq l\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by…
Relative Heffter arrays, denoted by $\mathrm{H}_t(m,n; s,k)$, have been introduced as a generalization of the classical concept of Heffter array. A $\mathrm{H}_t(m,n; s,k)$ is an $m\times n$ partially filled array with elements in…