Related papers: Nets in groups, minimum length $g$-adic representa…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
This article presents a geometric approach to some similarity problems involving metric arguments in the non-positively curved space of positive invertible operators of an operator algebra and the canonical isometric action by invertible…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
Consider a hyperbolic group G and a quasiconvex subgroup H of infinite index. We construct a set-theoretic section s of the quotient map (of sets) from G to G/H such that s(G/H) is a net in G; that is, any element of G is a bounded distance…
Let $A$ be a finite set of $k$ integers. For $h \leq k$, the restricted $h$-fold sumset $h^{\wedge} A$ is the set of all sums of $h$ distinct elements of $A$. In additive combinatorics, much of the focus has traditionally been on finite…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
A graph G on n vertices is said to be extendable if G can be modified to form a new graph H on more than n vertices, while preserving the degrees of the vertices common to G and H. The added vertices all have the same degree and we define…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
We give a general exposition of model theoretic connected components of groups. We show that if a group G has NIP, then there exists the smallest invariant (over some small set) subgroup of G with bounded index (Theorem 5.3). This result…
We give an accessible introduction into the theory of lower central series of associative algebras, exhibiting the interplay between algebra, geometry and representation theory that is characteristic for this subject, and to discuss some…
We investigate a new method to augment recurrent neural networks with extra memory without increasing the number of network parameters. The system has an associative memory based on complex-valued vectors and is closely related to…
We study parallel algorithms for addition of numbers having finite representation in a positional numeration system defined by a base $\beta$ in $\mathbb{C}$ and a finite digit set $\mathcal{A}$ of contiguous integers containing $0$. For a…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extending a simple drawing $D(G)$ of a graph $G$ by inserting a…
For graphs $G,H$ it is possible to add $(|V(G)|-\gamma(G))(|V(H)|-\gamma(H))$ edges to the Cartesian product $G\mathbin{\square}H$ such that a minimal dominating set $D$ of size $\gamma(G)\gamma(H)$ emerges. We hypothesize that $D$ is also…
We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…
The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $GA_1$ and…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received considerable attention…
We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of $m$ letters (corresponding to $m$ types of nodes) and a fixed set of connectivity rules. Recently, it was shown how a binary…