Related papers: A note on the Weiss conjecture

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…

We prove that every recurrent graph $G$ quasi-isometric to $\mathbb{R}$ admits an essentially unique Lipschitz harmonic function $h$. If $G$ is vertex-transitive, then the action of $Aut(G)$ preserves $\partial h$ up to a sign, a fact that…

A combinatorial proof of the Gordon Conjecture: The sum of two Heegaard splittings is stabilized if and only if one of the two summands is stabilized.

If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…

Under the assumption that a defining graph of a Coxeter group admits only twists in $\mathbb{Z}_2$ and is of type FC, we prove M\"uhlherr's Twist Conjecture.

We prove a new fixed point theorem of Schauder-type which applies to discontinuous operators in non-compact domains. In order to do so, we present a modification of a recent Schauder-type theorem due to Pouso. We apply our result to…

A theorem of Gerald Schwarz [24, Thm. 1] says that for a linear action of a compact Lie group $G$ on a finite dimensional real vector space $V$ any smooth $G$-invariant function on $V$ can be written as a composite with the Hilbert map. We…

Let $\Gamma$ be a connected $G$-arc-transitive graph, let $uv$ be an arc of $\Gamma$ and let $L$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$. We study the problem of…

In this paper, we identify two fractals if and only if they are biLipschitz equivalent. Fix ratio $r,$ for dust-like graph-directed sets with ratio $r$ and integer characteristics, we show that they are rigid in the sense that they are…

In this paper, we are motivated by the conjectures proposed by C.~Bender \textit{et al.}, \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove…

We introduce a bivariant version of the Cuntz semigroup as equivalence classes of order zero maps generalizing the ordinary Cuntz semigroup. The theory has many properties formally analogous to KK-theory including a composition product. We…

Let $W$ be a finite Coxeter group and $\Omega$ be its $W$-graph algebra as defined by Gyoja. The author's previous paper \cite{hahn2016wgraphs} considered this algebra in some detail, proposed, and proved in some small cases the $W$-graph…

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

In this work we determine the second-order coefficient in a parabolic equation from the knowledge of a single final data. Under assumptions on the concentration of eigenvalues of the associated elliptic operator, and the initial state, we…

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

Let red and blue points be distributed on $\mathbb{R}$ according to two independent Poisson processes $\mathcal{R}$ and $\mathcal{B}$ and let each red (blue) point independently be equipped with a random number of half-edges according to a…

We introduce the space of relative orders on a group and show that it is compact whenever the group is finitely generated. We use this to show that if $G$ is a finitely generated group acting by order preserving homeomorphism of on the…