Related papers: Combinatorial characterization of pseudometrics

Let $X$, $Y$ be sets and let $\Phi$, $\Psi$ be mappings with domains $X^{2}$ and $Y^{2}$ respectively. We say that $\Phi$ and $\Psi$ are combinatorially similar if there are bijections $f \colon \Phi(X^2) \to \Psi(Y^{2})$ and $g \colon Y…

Let $(X, d)$ be a semimetric space. A permutation $\Phi$ of the set $X$ is a combinatorial self similarity of $(X, d)$ if there is a bijective function $f \colon d(X^2) \to d(X^2)$ such that $$ d(x, y) = f(d(\Phi(x), \Phi(y))) $$ for all…

The group of combinatorial self-similarities of a pseudometric space $(X, d)$ is the maximal subgroup of the symmetric group $\mathbf{Sym} (X)$ whose elements preserve the four-point equality $d(x,y)=d(u,v)$. Let us denote by $\mathcal{IP}$…

Let $F,E\subseteq \mathbb{R}^2$ be two self similar sets. First, assuming $F$ is generated by an IFS $\Phi$ with strong separation, we characterize the affine maps $g:\mathbb{R}^2 \rightarrow \mathbb{R}^2$ such that $g(F)\subseteq F$. Our…

Let $\Phi(x,y)$ be a bivariate polynomial with complex coefficients. The zeroes of $\Phi(x,y)$ are given a combinatorial structure by considering them as arcs of a directed graph $G(\Phi)$. This paper studies some relationship between the…

In this article, we study the isomorphism problem for the algebras of $\Phi-$Pseudofunctions and $\Phi-$Pseudomeasures, denoted by $PF_\Phi(G)$ and $PM_\Phi(G),$ respectively. More precisely, for a certain class of Young functions $\Phi,$…

Let phi and psi be endomorphisms of the projective line of degree at least 2, defined over a noetherian commutative ring R with unity. From a dynamical perspective, a significant question is to determine whether phi and psi are conjugate…

A linear map $\Phi$ between matrix spaces is called cross-positive if it is positive on orthogonal pairs $(U,V)$ of positive semidefinite matrices in the sense that $\langle U,V\rangle:=\text{Tr}(UV)=0$ implies $\langle…

We address the following question. For which finitely generated pro-$p$ groups the comparison map $\phi^2:H_{cont}^{2}(P,\F_p) \to H_{disc}{2}(P,\F_p)$ is an isomorphism? We prove that if $P$ is not finitely presented then $\phi^2$ is not…

A (v,b,r,k) combinatorial configuration is a (r,k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some…

In this paper, we construct a partial group \(\mathcal{P}(F)\) that represents the "partial symmetry" inherent in a subset \(F\) of \(d\)-dimensional Euclidean space. In cases where \(F\) is not connected, \(\mathcal{P}(F)\) captures more…

We show that the (topological) full group of a minimal pseudogroup over the Cantor set satisfies various rigidity phenomena of topological dynamical and combinatorial nature. Our main result applies to its possible homomorphisms into other…

Let $X$ be a nonempty set and $X^{2}$ be the Cartesian square of $X$. Some semigroups of binary relations generated partitions of $X^2$ are studied. In particular, the algebraic structure of semigroups generated by the finest partition of…

Given groupoids $\mathscr G$ and $\mathscr H$ as well as an isomorphism $\Psi:\text{Sd}\,\mathscr G\cong\text{Sd}\,\mathscr H$ between subdivisions, we construct an isomorphism $P:\mathscr G\cong\mathscr H$. If $\Psi$ equals $\text{Sd} F$…

A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…

Let $G$ and $H$ be quasi-isometric finitely generated groups and let $P\leq G$; is there a subgroup $Q$ (or a collection of subgroups) of $H$ whose left cosets coarsely reflect the geometry of the left cosets of $P$ in $G$? We explore…

If G is a group, a pseudocharacter f: G-->R is a function which is "almost" a homomorphism. If G admits a nontrivial pseudocharacter f, we define the space of ends of G relative to f and show that if the space of ends is complicated enough,…

As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…