Related papers: Combinatorial designs and the Prouhet--Tarry--Esco…
We introduce a new class of numerical schemes which allow for low regularity approximations to the expectation $ \mathbb{E}(|u_{k}(\tau, v^{\eta})|^2)$, where $u_k$ denotes the $k$-th Fourier coefficient of the solution $u$ of the…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $\lambda$ points (and $\lambda < v$ is a fixed number) and…
We describe a way of solving a partial differential equation using the differential invariants of its point symmetries. By first solving its quotient PDE, which is given by the differential syzygies in the algebra of differential…
The problem of constructing optimal discriminating designs for a class of regression models is considered. We investigate a version of the $T_p$-optimality criterion as introduced by Atkinson and Fedorov [Biometrika 62 (1975a) 289-303]. The…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…
It is sometimes desirable to produce for a nonlinear system of ODEs a new representation of simpler structural form, but it is well known that this goal may imply an increase in the dimension of the system. This is what happens if in this…
For a positive integer sequence $\boldsymbol{a}=(a_1, \dots, a_{N+1})$, Sylvester's denumerant $E(\boldsymbol{a}; t)$ counts the number of nonnegative integer solutions to $\sum_{i=1}^{N+1} a_i x_i = t$ for a nonnegative integer $t$. It has…
In an order-of-addition experiment, each treatment is a permutation of m components. It is often unaffordable to test all the m! treatments, and the design problem arises. We consider a model that incorporates the order of each pair of…
In computational design and fabrication, neural networks are becoming important surrogates for bulky forward simulations. A long-standing, intertwined question is that of inverse design: how to compute a design that satisfies a desired…
Due to the multi-linearity of tensors, most algorithms for tensor optimization problems are designed based on the block coordinate descent method. Such algorithms are widely employed by practitioners for their implementability and…
A new approximation format for solutions of partial differential equations depending on infinitely many parameters is introduced. By combining low-rank tensor approximation in a selected subset of variables with a sparse polynomial…
Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We present a method for computing A-optimal sensor placements for infinite-dimensional Bayesian linear inverse problems governed by PDEs with irreducible model uncertainties. Here, irreducible uncertainties refers to uncertainties in the…
The theory of designs is an important branch of combinatorial mathematics. It is well-known in the theory of designs that a finite subset of a sphere is a tight spherical 1-design if and only if it is a pair of antipodal points. On the…
In 2004, Enriquez-Etingof-Marshall suggested a new approach to the Ginzburg-Weinstein linearization theorem for a quasitriangular Lie bialgebra $(\g,r)$. This approach is based on solving a system of PDEs for a gauge transformation between…
The aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner System $S(t,n,v)$ we associate two ideals, in a suitable polynomial ring, defining a Steiner…
Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems…