Related papers: Combinatorial designs and the Prouhet--Tarry--Esco…
We devise a {\sl non--perturbative} method, called {\sl Parametric Perturbation Theory} (PPT), which is alternative to the ordinary perturbation theory. The method relies on a principle of simplicity for the observable solutions, which are…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
This paper introduces general methodologies for constructing closed-form solutions to linear constant-coefficient partial differential equations (PDEs) with polynomial right-hand sides in two and three spatial dimensions. Polynomial…
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…
We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…
We consider optimal experimental design (OED) for Bayesian nonlinear inverse problems governed by partial differential equations (PDEs) under model uncertainty. Specifically, we consider inverse problems in which, in addition to the…
Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309}…
A Euclidean $t$-design, as introduced by Neumaier and Seidel (1988), is a finite set ${\cal X} \subset \mathbb{R}^n$ with a weight function $w: {\cal X} \rightarrow \mathbb{R}^+$ for which $$\sum_{r \in R} W_r \overline{f}_{S_{r}} =…
Singular perturbation theory plays a central role in the approximate solution of nonlinear differential equations. However, applying these methods is a subtle art owing to the lack of globally applicable algorithms. Inspired by the fact…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…
We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs, and strong $s$-blocking sets over finite fields. Our focus…
The paper represents the method for construction of the families of particular solutions to some new classes of $(n+1)$ dimensional nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
In [9], [15] it has been introduced a technique, based on nonstandard analysis, to study some problems in combinatorial number theory. In this paper we present three applications of this technique: the first one is a new proof of a known…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
The Painlev\'e analysis introduced by Weiss, Tabor and Carnevale (WTC) in 1983 for nonlinear partial differential equations (PDE's) is an extension of the method initiated by Painlev\'e and Gambier at the beginning of this century for the…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
Recent results in the theory and application of Newton-Puiseux expansions, i.e. fractional power series solutions of equations, suggest further developments within a more abstract algebraic-geometric framework, involving in particular the…