相关论文: Mixed orthogonal arrays, $(u,m,{\bf e},s)$-nets, a…

Motivated by results of Henry, Pralat and Zhang (PNAS 108.21 (2011): 8605-8610), we propose a general scheme for evolving spatial networks in order to reduce their total edge lengths. We study the properties of the equilbria of two networks…

This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic…

The crucial role played by the underlying symmetries of high energy physics and lattice field theories calls for the implementation of such symmetries in the neural network architectures that are applied to the physical system under…

Combinatorial problems arising in puzzles, origami, and (meta)material design have rare sets of solutions, which define complex and sharply delineated boundaries in configuration space. These boundaries are difficult to capture with…

We establish a surprisingly close relationship between universal Horn classes of directed graphs and varieties generated by so-called adjacency semigroups which are Rees matrix semigroups over the trivial group with the unary operation of…

For any given neural network architecture a permutation of weights and biases results in the same functional network. This implies that optimization algorithms used to `train' or `learn' the network are faced with a very large number (in…

In many networks, including networks of protein-protein interactions, interdisciplinary collaboration networks, and semantic networks, connections are established between nodes with complementary rather than similar properties. While…

The class of $(0,m,s)$-nets in base $b$ has been introduced by Niederreiter as examples of point sets in the $s$-dimensional unit cube with excellent uniform distribution properties. In particular such nets have been proved to have very low…

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

The study of complex networks has been historically based on simple graph data models representing relationships between individuals. However, often reality cannot be accurately captured by a flat graph model. This has led to the…

We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ with respect regular functionals ${\bf u}$ and ${\bf v}$, respectively. We assume that $$\sum_{j=1} ^{M} a_{j,n}\mathrm{D}_x ^k P_{k+n-j}…

Stochasticity is introduced to a well studied class of recursively grown graphs: $(u,v)$-flower nets, which have power-law degree distributions as well as small-world properties (when $u=1$). The stochastic variant interpolates between…

Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and…

In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…

Webs are graphical objects that give a tangible, combinatorial way to compute and classify tensor invariants. Recently, [Gaetz, Pechenik, Pfannerer, Striker, Swanson 2023+] found a rotation-invariant web basis for $\mathrm{SL}_4$, as well…

Previous work on symmetric group equivariant neural networks generally only considered the case where the group acts by permuting the elements of a single vector. In this paper we derive formulae for general permutation equivariant layers,…

We amalgamate two generalizations of Ramsey's Theorem--Ramsey classes and the Erd\H{o}s-Rado Theorem--into the notion of a combinatorial Erd\H{o}s-Rado class. These classes are closely related to Erd\H{o}s-Rado classes, which are those from…

Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges, in which each vertex $u$ is assigned an integer priority in $[1,n]$, with 1 being the "highest" priority. Let $M$ be a matching of $G$. We define the priority score of…

We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations…

In certain situations, neural networks are trained upon data that obey underlying symmetries. However, the predictions do not respect the symmetries exactly unless embedded in the network structure. In this work, we introduce architectures…