Related papers: More on the corner-vector construction for spheric…

The rational Chow ring A?(S[n],Q) of the Hilbert scheme S[n] parametrising the length n zero-dimensional subschemes of a toric surface S can be described with the help of equivariant techniques. In this paper, we explain the general method…

We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…

73 new cubature rules are found for three standard multidimensional integrals with spherically symmetric regions and weights, using direct search with a numerical zero-finder. All but four of the new rules have fewer integration points than…

This article can be seen as a sequel to the first author's article ``Chern classes of the tangent bundle on the Hilbert scheme of points on the affine plane'', where he calculates the total Chern class of the Hilbert schemes of points on…

This paper investigates a generalized hyperbolic circle packing (including circles, horocycles or hypercycles) with respect to the total geodesic curvatures on the surface with boundary. We mainly focus on the existence and rigidity of…

We introduce orthogonal ring patterns in the 2-sphere and in the hyperbolic plane, consisting of pairs of concentric circles, which generalize circle patterns. We show that their radii are described by a discrete integrable system. This is…

We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…

In this article, we study the complexity involved in the computation of the reach in arbitrary dimension and in particular the computation of the critical spherical curvature points of an arbitrary algebraic variety. We present properties…

The standard method for constructing generating vectors for good lattice point sets is the component-by-component construction. Numerical experiments have shown that the generating vectors found by these constructions sometimes tend to have…

The (fast) component-by-component (CBC) algorithm is an efficient tool for the construction of generating vectors for quasi-Monte Carlo rank-1 lattice rules in weighted reproducing kernel Hilbert spaces. We consider product weights, which…

An integral lattice which is generated by some vectors of norm $q$ is called $q$-lattice. Classification of 3-lattices of dimension at most four is given by Mimura (On 3-lattice, 2006). As a expansion, we give a classification of 3-lattices…

In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…

A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…

We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.

Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…

Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand. In this way,…

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

We algebraically compute all possible sectional curvature values for canonical algebraic curvature tensors, and use this result to give a method for constructing general sectional curvature bounds. We use a well-known method to…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

Analysis of the generalized Weierstrass-Enneper system includes the estimation of the degree of indeterminancy of the general analytic solution and the discussion of the boundary value problem. Several different procedures for constructing…