$\mathcal {F}$-hypercyclic and disjoint $\mathcal {F}$-hypercyclic properties of binary relations over topological spaces

Marko Kostić

Displaying similar documents to “ $ℱ$ -hypercyclic and disjoint $ℱ$ -hypercyclic properties of binary relations over topological spaces”

A note on solvable vertex stabilizers of $s$ -transitive graphs of prime valency

Song-Tao Guo, Hailong Hou, Yong Xu (2015)

Czechoslovak Mathematical Journal

Similarity:

A graph $X$ , with a group $G$ of automorphisms of $X$ , is said to be $(G, s)$ -transitive, for some $s \geq 1$ , if $G$ is transitive on $s$ -arcs but not on $(s + 1)$ -arcs. Let $X$ be a connected $(G, s)$ -transitive graph of prime valency $p \geq 5$ , and $G_{v}$ the vertex stabilizer of a vertex $v \in V (X)$ . Suppose that $G_{v}$ is solvable. Weiss (1974) proved that $| G_{v} {| ∣ p (p - 1)}^{2}$ . In this paper, we prove that $G_{v} ≅ (ℤ_{p} ⋊ ℤ_{m}) \times ℤ_{n}$ for some positive integers $m$ and $n$ such that $n div m$ and $m ∣ p - 1$ .

Tetravalent half-arc-transitive graphs of order $p^{2} q^{2}$

Hailin Liu, Bengong Lou, Bo Ling (2019)

Czechoslovak Mathematical Journal

Similarity:

We classify tetravalent $G$ -half-arc-transitive graphs $Γ$ of order $p^{2} q^{2}$ , where $G \leq 𝖠𝗎𝗍 Γ$ and $p$ , $q$ are distinct odd primes. This result involves a subclass of tetravalent half-arc-transitive graphs of cube-free order.

Representation functions for binary linear forms

Fang-Gang Xue (2024)

Czechoslovak Mathematical Journal

Similarity:

Let $ℤ$ be the set of integers, $ℕ_{0}$ the set of nonnegative integers and $F (x_{1}, x_{2}) = u_{1} x_{1} + u_{2} x_{2}$ be a binary linear form whose coefficients $u_{1}$ , $u_{2}$ are nonzero, relatively prime integers such that $u_{1} u_{2} \neq \pm 1$ and $u_{1} u_{2} \neq - 2$ . Let $f : ℤ \to ℕ_{0} \cup {\infty}$ be any function such that the set $f^{- 1} (0)$ has asymptotic density zero. In 2007, M. B. Nathanson (2007) proved that there exists a set $A$ of integers such that $r_{A, F} (n) = f (n)$ for all integers $n$ , where $r_{A, F} (n) = | {(a, a^{'}) : n = u_{1} a + u_{2} a^{'} : a, a^{'} \in A} |$ . We add the structure of difference for the binary linear form $F (x_{1}, x_{2})$ .

Properties of unique information

Johannes Rauh, Maik Schünemann, Jürgen Jost (2021)

Kybernetika

Similarity:

We study the unique information function $U I (T : X ∖ Y)$ defined by Bertschinger et al. within the framework of information decompositions. In particular, we study uniqueness and support of the solutions to the convex optimization problem underlying the definition of $U I$ . We identify sufficient conditions for non-uniqueness of solutions with full support in terms of conditional independence constraints and in terms of the cardinalities of $T$ , $X$ and $Y$ . Our results are based on a reformulation of the first...

Algebraic and topological properties of some sets in ℓ₁

Taras Banakh, Artur Bartoszewicz, Szymon Głąb, Emilia Szymonik (2012)

Colloquium Mathematicae

Similarity:

For a sequence x ∈ ℓ₁∖c₀₀, one can consider the set E(x) of all subsums of the series $\sum_{n = 1}^{\infty} x (n)$ . Guthrie and Nymann proved that E(x) is one of the following types of sets: () a finite union of closed intervals; () homeomorphic to the Cantor set; homeomorphic to the set T of subsums of $\sum_{n = 1}^{\infty} b (n)$ where b(2n-1) = 3/4ⁿ and b(2n) = 2/4ⁿ. Denote by ℐ, and the sets of all sequences x ∈ ℓ₁∖c₀₀ such that E(x) has the property (ℐ), () and ( ), respectively. We show that ℐ and are strongly -algebrable and is -lineable....

A tight quantitative version of Arrow’s impossibility theorem

Nathan Keller (2012)

Journal of the European Mathematical Society

Similarity:

The well-known Impossibility Theorem of Arrow asserts that any generalized social welfare function (GSWF) with at least three alternatives, which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a dictatorship, is necessarily non-transitive. In 2002, Kalai asked whether one can obtain the following quantitative version of the theorem: For any $ϵ > 0$ , there exists $δ = δ (ϵ)$ such that if a GSWF on three alternatives satisfies the IIA condition and its probability of...

A countably cellular topological group all of whose countable subsets are closed need not be $ℝ$ -factorizable

Mihail G. Tkachenko (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We construct a Hausdorff topological group $G$ such that $ℵ_{1}$ is a precalibre of $G$ (hence, $G$ has countable cellularity), all countable subsets of $G$ are closed and $C$ -embedded in $G$ , but $G$ is not $ℝ$ -factorizable. This solves Problem 8.6.3 from the book “Topological Groups and Related Structures" (2008) in the negative.

A note on a conjecture on niche hypergraphs

Pawaton Kaemawichanurat, Thiradet Jiarasuksakun (2019)

Czechoslovak Mathematical Journal

Similarity:

For a digraph $D$ , the niche hypergraph $N ℋ (D)$ of $D$ is the hypergraph having the same set of vertices as $D$ and the set of hyperedges $E (N ℋ (D)) = {e \subseteq V (D) : | e | \geq 2$ and there exists a vertex $v$ such that $e = N_{D}^{-} (v)$ or $e = N_{D}^{+} (v)}$ . A digraph is said to be acyclic if it has no directed cycle as a subdigraph. For a given hypergraph $ℋ$ , the niche number $\hat{n} (ℋ)$ is the smallest integer such that $ℋ$ together with $\hat{n} (ℋ)$ isolated vertices is the niche hypergraph of an acyclic digraph. C. Garske, M. Sonntag and H. M. Teichert (2016) conjectured that for a linear...

On $n$ -thin dense sets in powers of topological spaces

Adam Bartoš (2016)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A subset of a product of topological spaces is called $n$ -thin if every its two distinct points differ in at least $n$ coordinates. We generalize a construction of Gruenhage, Natkaniec, and Piotrowski, and obtain, under CH, a countable $T_{3}$ space $X$ without isolated points such that $X^{n}$ contains an $n$ -thin dense subset, but $X^{n + 1}$ does not contain any $n$ -thin dense subset. We also observe that part of the construction can be carried out under MA.

Construction methods for gaussoids

Tobias Boege, Thomas Kahle (2020)

Kybernetika

Similarity:

The number of $n$ -gaussoids is shown to be a double exponential function in $n$ . The necessary bounds are achieved by studying construction methods for gaussoids that rely on prescribing $3$ -minors and encoding the resulting combinatorial constraints in a suitable transitive graph. Various special classes of gaussoids arise from restricting the allowed $3$ -minors.

Displaying similar documents to “ ℱ -hypercyclic and disjoint ℱ -hypercyclic properties of binary relations over topological spaces”

Displaying similar documents to “ $ℱ$ -hypercyclic and disjoint $ℱ$ -hypercyclic properties of binary relations over topological spaces”