Related papers: Combinatorial designs and the Prouhet--Tarry--Esco…
We consider a class of nonlinear elliptic problems associated with models in biophysics, which are described by the Poisson-Boltzmann equation (PBE). We prove mathematical correctness of the problem, study a suitable class of…
This paper is devoted to the explicit construction of optimal designs for discrimination between two polynomial regression models of degree $n-2$ and $n$. In a fundamental paper, Atkinson and Fedorov [Biometrika 62 (1975a) 57--70] proposed…
This work presents a geometrical formulation of the Clairin theory of conditional symmetries for higher-order systems of partial differential equations (PDEs). We devise methods for obtaining Lie algebras of conditional symmetries from…
A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks. Such $t$-designs over $\F_q$ are…
We represent an algorithm allowing one to construct new classes of partially integrable multidimensional nonlinear partial differential equations (PDEs) starting with the special type of solutions to the (1+1)-dimensional hierarchy of…
High-dimensional partial differential equations (PDE) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment (CVA) models, or portfolio optimization models. The PDEs in…
We consider the problem of computing the integrable sub-distributions of the non-integrable Vessiot distribution of multi-dimensional second order partial differential equations (PDEs). We use Vessiot theory and solvable structures to find…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
Partial Differential Equations (PDEs) are fundamental tools for modeling physical phenomena, yet most PDEs of practical interest cannot be solved analytically and require numerical approximations. The feasibility of such numerical methods,…
It is shown that large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems, can be solved by the method of order completion. The solutions obtained can be assimilated with Hausdorff…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
We formulate a conjecture classifying algebraic solutions to (possibly non-linear) algebraic differential equations, in terms of the primes appearing in the denominators of the coefficients of their Taylor expansion at a non-singular point.…
Combinatorial designs have been studied for nearly 200 years. Fifty years ago, Cameron, Delsarte, and Ray-Chaudhury started investigating their q-analogs, also known as subspace designs or designs over finite fields. Designs can be defined…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
The radiative transfer equation (RTE) has been established as a fundamental tool for the description of energy transport, absorption and scattering in many relevant societal applications, and requires numerical approximations. However,…
Mixed superposition rules are, in short, a method to describe the general solutions of a time-dependent system of first-order differential equations, a so-called Lie system, in terms of particular solutions of other ones. This article is…
The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…
Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…
Toric $t$-designs, or equivalently $t$-designs on the diagonal subgroup of the unitary group, are sets of points on the torus over which sums reproduce integrals of degree $t$ monomials over the full torus. Motivated by the projective…
We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum discrepancy of the label values within each of the sets is…