Related papers: Minimal cubature rules on an unbounded domain

We construct two infinite families of algebraic minimal cones in $R^{n}$. The first family consists of minimal cubics given explicitly in terms of the Clifford systems. We show that the classes of congruent minimal cubics are in one to one…

We study the structure of the codifferent and of additively indecomposable integers in families of totally real cubic fields. We prove that for cubic orders in these fields, the minimal trace of indecomposable integers multiplied by totally…

Given an unbounded domain $\Omega$ of a Hadamard manifold $M$, it makes sense to consider the problem of finding minimal graphs with prescribed continuous data on its cone-topology-boundary, i.e., on its ordinary boundary together with its…

This note describes a method for generating an infinite-dimensional family of nonlinear control laws for underactuated systems. For a ball and beam system, the entire family is found explicitly.

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Node elimination is a numerical approach to obtain cubature rules for the approximation of multivariate integrals. Beginning with a known cubature rule, nodes are selected for elimination, and a new, more efficient rule is constructed by…

We develop a novel topological framework that yields results constraining the distribution of zeros of certain zero mean real-valued maps, namely those obtained from composing a fixed equivariant map with linear functionals. We use this…

We construct a complete, embedded minimal surface in euclidean 3-space which has unbounded Gaussian curvature. It has infinite genus, infinitely many catenoidal type ends and one limit end.

As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…

For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator bound. There are several bounds in the literature. The…

We construct open domains in Euclidean 3-space which do not admit complete properly immersed minimal surfaces with an annular end. These domains can not be smooth by a recent result of Martin and Morales

We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…

An explicit upper bound is established for the least non-trivial integer zero of an arbitrary cubic form $C \in \mathbb{Z}[X_1,...,X_n],$ provided that $n \geq 14.$

For some class of mappings satisfying upper modular estimates with respect to families of curves, a behavior of the corresponding inverse mappings is investigated. In the terms of prime ends, it is proved that, families of such…

We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce…

The behavior of a class of mappings of a domain of Euclidean space is studied. It is established that the indicated class is equicontinuous both at the inner and at the boundary points of the domain if the mappings contained in it satisfy…

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

We provide a necessary and sufficient condition for existence of Gaussian cubature formulas. It consists of checking whether some overdetermined linear system has a solution and so complements Mysovskikh's theorem which requires computing…

We consider isotropic non lower semicontinuous weighted perimeter functionals defined on partitions of domains in $\mathbb{R}^n$. Besides identifying a condition on the structure of the domain which ensures the existence of minimizing…

In this paper, we extend the theory of minimal limit key polynomials of valuations on the polynomial ring $\kx$. We use the theory of cuts on ordered abelian groups to show that the previous results on bounded sets of key polynomials of…