Related papers: A uniform model for almost convexity and rewriting…

Groups with the falsification by fellow traveler property are known to have solvable word problem, but they are not known to be automatic or to have finite convergent rewriting systems. In this paper, we show that these groups admit a…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…

The problem of optimizing over random structures emerges in many areas of science and engineering, ranging from statistical physics to machine learning and artificial intelligence. For many such structures finding optimal solutions by means…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

In this article, we introduce an interesting topology-like concept concerning groups (and with almost the same method it can be defined for other algebraic systems). Given an arbitrary group $G$, we define a {\em topo-system} on $G$ as a…

Classical finite association schemes lead to a finite-dimensional algebras which are generated by finitely many stochastic matrices. Moreover, there exist associated finite hypergroups. The notion of classical discrete association schemes…

Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally robust against additive noise and erasures, and as such, have great potential…

We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…

The fundamental groups of most (conjecturally, all) closed 3-manifolds with uniform geometries have finite complete rewriting systems. The fundamental groups of a large class of amalgams of circle bundles also have finite complete rewriting…

We introduce the notion of a telescope of groups. Very roughly a telescope is a directed system of groups that contains various commuting images of some fixed group $B$. Telescopes are inspired from the theory of groups acting on rooted…

This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…

This paper shows how, in a quasi metric space, an inexact proximal algorithm with a generalized perturbation term appears to be a nice tool for Behavioral Sciences (Psychology, Economics, Management, Game theory,...). More precisely, the…

We develop a general theory of "bisets": sets with two commuting group actions. They naturally encode topological correspondences. Just as van Kampen's theorem decomposes into a graph of groups the fundamental group of a space given with a…

We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product of surface groups. This allows us to detect a non-trivial obstruction bounding from below the effective topological complexity of an…

In many areas such as computational biology, finance or social sciences, knowledge of an underlying graph explaining the interactions between agents is of paramount importance but still challenging. Considering that these interactions may…

The main achievement of this thesis is an algorithm which given a finite group presentation and natural numbers n and k, computes all the relators of length and area up to n and k respectively. The complexity of this algorithm is better by…

We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term…

In this paper, we pose the concepts of pre-topological groups and some generalizations of pre-topological groups. First, we systematically investigate some basic properties of pre-topological groups; in particular, we prove that each…