English
Related papers

Related papers: Comparing the closed almost disjointness and domin…

200 papers

In this article, we deal with several notions in dynamical systems. Firstly, we prove that both closure function and orbital function are idempotent on set-valued dynamical systems. And we show that the compact limit set of a connected set…

Dynamical Systems · Mathematics 2013-06-06 Hahng-Yun Chu , Ahyoung Kim , Jong-Suh Park

A review of the state of the art of the comparison between any two different modes of convergence of sequences of measurable functions is carried out with focus on the algebraic structure of the families under analysis. As a complement of…

Functional Analysis · Mathematics 2026-04-10 L. Bernal-González , M. C. Calderón-Moreno , P. J. Gerlach-Mena , J. A. Prado-Bassas

The greatest power of a prime $p$ dividing the natural number $n$ will be denoted by $n_p$. Let $Ind_G(g)=|G:C_G(g)|$. Suppose that $G$ is a finite group and $p$ is a prime. We prove that if there exists an integer $\alpha>0$ such that…

Group Theory · Mathematics 2023-06-22 Ilya Gorshkov

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

Combinatorics · Mathematics 2007-05-23 Robert Morris

For a positive integer $n>1$ denote by $\omega(n)$ the maximal possible number $k$ of different functions $f_1,\dots,f_k:\mathbb{Z}/n\mathbb{Z}\mapsto \mathbb{Z}/n\mathbb{Z}$ such that each function $f_i-f_j,i<j$, is bijective. Recently A.…

Combinatorics · Mathematics 2019-01-03 D. Cherkashin , F. Petrov , V. Sokolov

A matching in a hypergraph $\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $\nu(\mathcal{H})$ of $\mathcal{H}$ is the size of a maximum matching in $\mathcal{H}$. A subset $D$ of vertices of $\mathcal{H}$ is a…

Combinatorics · Mathematics 2016-11-22 Erfang Shan , Yanxia Dong , Liying Kang , Shan Li

We study the representation theory of the infinite type A Hecke algebra over a non-archimedean field in the case where the parameter is a pseudo-uniformizer. Specifically, we consider a family of representations, called almost-symmetric,…

Representation Theory · Mathematics 2026-03-25 Milo Bechtloff Weising

In this paper we study arithmetical and structural features of a finite group that possesses exactly two conjugacy class sizes that are composite numbers.

Group Theory · Mathematics 2025-10-29 Carmine Monetta , Víctor Sotomayor

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

Operator Algebras · Mathematics 2025-02-26 Huaxin Lin

A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian product of two graphs is well-dominated. In addition, we show…

Combinatorics · Mathematics 2019-09-24 Sarah E. Anderson , Kirsti Kuenzel , Douglas F. Rall

Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\gamma_t(G)$. A set $S$ of vertices in $G$ is a…

Combinatorics · Mathematics 2014-11-04 Michael A. Henning , Viroshan Naicker

At least two different notions have been published under the name "majority domination in graphs": Majority dominating functions and majority dominating sets. In this work we extend the former concept to digraphs. Given a digraph $D=(V,A),$…

Combinatorics · Mathematics 2013-11-05 Martín Manrique , Karam Ebadi , Akbar Azami

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

Combinatorics · Mathematics 2024-09-24 Gal Gross

We construct families of finitely presented groups exhibiting new divergence behavior; we obtain divergence functions of the form $r^\alpha$ for a dense set of exponents $\alpha \in [2,\infty)$ and $r^n\log(r)$ for integers $n \geq 2$. The…

Group Theory · Mathematics 2020-11-02 Noel Brady , Hung Cong Tran

A proper subgroup $H$ in a finite group $G$ is said to be large if $|H|^3\geq |G|$. In this paper, we determined all large maximal subgroups of almost simple classical groups. Combined with the work of Alavi and Burness (J. Algebra 421…

Group Theory · Mathematics 2025-07-01 Fu-Gang Yin , Ting Lan , Weijun Liu , Oujie Chen

Let S=Sym(\Omega) be the group of all permutations of a countably infinite set \Omega, and for subgroups G_1, G_2\leq S let us write G_1\approx G_2 if there exists a finite set U\subseteq S such that < G_1\cup U > = < G_2\cup U >. It is…

Group Theory · Mathematics 2007-06-13 George M. Bergman , Saharon Shelah

Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…

Combinatorics · Mathematics 2023-02-20 Csilla Bujtás , Nima Ghanbari , Sandi Klavžar

We emulate the Rademacher functions on any non-commutative compact group requiring the resulting system to have pairwise disjoint spectra.

Group Theory · Mathematics 2007-05-23 Javier Parcet

We provide answers to a question brought up by Erd\H{o}s about the construction of Wetzel families in the absence of the continuum hypothesis - a Wetzel family is a family $\mathcal{F}$ of entire functions on the complex plane which…

Logic · Mathematics 2024-05-14 Jonathan Schilhan , Thilo Weinert

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…

Logic · Mathematics 2007-05-23 Michael Pinsker
‹ Prev 1 4 5 6 7 8 10 Next ›