Related papers: A uniform model for almost convexity and rewriting…
Quite recently, a new property related to norm-attaining operators has been introduced: the weak maximizing property (WMP). In this note, we define a generalised version of it considering other topologies than the weak one (mainly the…
Free groups are known to be homogeneous, meaning that finite tuples of elements which satisfy the same first-order properties are in the same orbit under the action of the automorphism group. We show that virtually free groups have a…
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…
The chief aim of this paper is to describe a procedure which, given a $d$-dimensional absolutely irreducible matrix representation of a finite group over a finite field $\mathbb{E}$, produces an equivalent representation such that all…
Consider a finite, regular cover $Y\to X$ of finite graphs, with associated deck group $G$. We relate the topology of the cover to the structure of $H_1(Y;\mathbb{C})$ as a $G$-representation. A central object in this study is the {\em…
In this paper, we investigate structural properties of finite groups that are detected by certain group invariants arising from Dijkgraaf--Witten theory, a topological quantum field theory, in one space and one time dimension. In this…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
In this chapter we survey two topics that have recently been investigated in frame theory. First, we give an overview of the class of scalable frames. These are (finite) frames with the property that each frame vector can be rescaled in…
A process discovery algorithm aims to construct a model from data generated by historical system executions such that the model describes the system well. Consequently, one desired property of a process discovery algorithm is…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…
We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…
We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…
Fibred semantics is the foundation of the model-instance pattern of software engineering. Software models can often be formalized as objects of presheaf topoi, i.e, categories of objects that can be represented as algebras as well as…
A topology is defined on the mapping class group of a compact connected orientable surface. It is shown that a notion of "genericity" on subsets of the mapping class group arises from this definition. Many plausible results follow from this…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
The purpose of this paper is to characterize one-dimensional local domains, or more in general reduced, in terms of its Macaulay's inverse system. This leads to study almost finitely generated modules in the divided power ring. We…
We announce an atlas of subgroup lattices of almost simple groups and present two algorithms that were used to produce the atlas.
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…