Let be a finite field of order which is a prime power. In the finite field setting, we say that a function is a Mattila-Sjölin type function in if for any with , we have . The main purpose of this talk is to present …
Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led computers to reach superhuman level play in Atari games and Go, purely through self-play. In …
An intersection digraph is a digraph where every vertex is represented by an ordered pair of sets such that there is an edge from to if and only if and intersect. An intersection digraph is reflexive if for every vertex . Compared to well-known undirected …
An interval graph is the intersection graph of a family of intervals in the real line. Motivated by problems in ecology, Roberts defined the boxicity of a graph G to be the minimal k such that G can be written as the intersection of k interval graphs. A natural higher-dimensional generalization of interval graphs is …
The preservation of symmetry is one of the key tools for designing data-efficient neural networks. A representative example is convolutional neural networks (CNNs); they preserve translation symmetries, and this symmetry preservation is often attributed to their success in real-world applications. In the machine-learning community, there is a growing body of work that explores a new …
In this talk, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations in terms of the entries in the first row with integer coefficients. Using these conditions we show the invertibility of some family of circulant matrices with particular forms of …
The local connectivity from to is defined to be the maximal number of internally disjoint paths in . A spanning subdigraph of with for every must have at …
