Related papers: A method of constructing pairwise balanced designs…
We show the equivalence between one-way reflections and relative projective representations. We construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We give two applications of the…
The paper develops the method for construction of families of particular solutions to some classes of nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic matrix equations and PDE.…
We describe a new class of positive linear discrete-time switching systems for which the problems of stability or stabilizability can be resolved constructively. This class generalizes the class of systems with independently switching state…
Generative design (GD) methods aim to automatically generate a wide variety of designs that satisfy functional or aesthetic design requirements. However, research to date generally lacks considerations of manufacturability of the generated…
High Performance Computing is notorious for its long and expensive software development cycle. To address this challenge, we present Bind: a "partitioned global workflow" parallel programming model for C++ applications that enables quick…
The article contains a preliminary glance at balanced clustering problems. Basic balanced structures and combinatorial balanced problems are briefly described. A special attention is targeted to various balance/unbalance indices (including…
The ability to control forces between sub-micron-scale building blocks offers considerable potential for designing new materials through self-assembly. A typical paradigm is to first identify a particular (crystal) structure that has some…
Combinatorial group testing (CGT) is used to identify defective items from a set of items by grouping them together and performing a small number of tests on the groups. Recently, group testing has been used to design efficient COVID-19…
Let G = (V, E) be a planar triangulated graph (PTG) having every face triangular. A rectilinear dual or an orthogonal floor plan (OFP) of G is obtained by partitioning a rectangle into \mid V \mid rectilinear regions (modules) where two…
This paper presents a generalization of the sandpile model, called the parallel symmetric sandpile model, which inherits the rules of the symmetric sandpile model and implements them in parallel. In this new model, at each step the…
Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the…
High dimensional unconstrained quadratic programs (UQPs) involving massive datasets are now common in application areas such as web, social networks, etc. Unless computational resources that match up to these datasets are available, solving…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
This paper presents a new method of constructing physical models in a geophysical inverse problem, when there are only a few possible physical property values in the model and they are reasonably known but the geometry of the target is…
The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…
A comprehensive approach addressing identification and control for learningbased Model Predictive Control (MPC) for linear systems is presented. The design technique yields a data-driven MPC law, based on a dataset collected from the…
Graph theory and enumerative combinatorics are two branches of mathematical sciences that have developed astonishingly over the past one hundred years. It is especially important to point out that graph theory employs combinatorial…
A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…
In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…
Hybrid model predictive control with both continuous and discrete variables is widely applicable to robotic control tasks, especially those involving contact with the environment. Due to the combinatorial complexity, the solving speed of…