Related papers: Presentations with negative deficiency and largene…

The large deviations principles are established for a class of multidimensional degenerate stochastic differential equations with reflecting boundary conditions. The results include two cases where the initial conditions are adapted and…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

A group is known as `large' if some finite index subgroup admits a surjective homomorphism onto a non-abelian free group. In this paper, we give a necessary and sufficient condition for a finitely presented group to be large, in terms of…

We prove that if a group possesses a deficiency 1 presentation where one of the relators is a commutator then it is the integers times the integers, is large, or is as far as possible from being residually finite. Then we use this to show…

The aim of this note is to give an easy example of a finitely presented group that cannot act without a fix point on a CAT(0) space of finite dimension. Such an example has been recently constructed by Arjantseva et al., using other…

A broad set of sufficient conditions that guarantees the existence of the maximum entropy (maxent) distribution consistent with specified bounds on certain generalized moments is derived. Most results in the literature are either focused on…

This book deals with functions allowing to express the dissimilarity (discrepancy) between two data fields or ''divergence functions'' with the aim of applications to linear inverse problems. Most of the divergences found in the litterature…

We consider optimization problems with a disjunctive structure of the constraints. Prominent examples of such problems are mathematical programs with equilibrium constraints or vanishing constraints. Based on the concepts of directional…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These…

In Grayson's combinatorial description of higher K-groups, the generators are bounded acyclic binary multi-complexes of arbitrary size. Generalising work by Kasprowski, Winges and the author, we show in this paper that multi-complexes of…

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

A positive representation for a set of complex densities is constructed. In particular, complex measures on a direct product of U(1) groups are studied. After identifying general conditions which such representations should satisfy, several…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.

Large Language Models (LLMs) can be deployed in situations where they process positive/negative interactions with other agents. We study how this is done under the sociological framework of social balance, which explains the emergence of…

Contrastive learning is among the most successful methods for visual representation learning, and its performance can be further improved by jointly performing clustering on the learned representations. However, existing methods for joint…

We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…

We define k-genericity and k-largeness for a subset of a group, and determine the value of k for which a k-large subset of G^n is already the whole of G^n , for various equationally defined subsets. We link this with the inner measure of…