Related papers: Symmetric Submodular Functions, Uncrossable Functi…

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

For any block of a finite group over an algebraically closed field of characteristic $2$ which has dihedral, semidihedral, or generalized quaternion defect groups, we determine explicitly the decomposition of the associated diagonal…

In this paper, all rings are commutative with nonzero identity. Let $M$ be an $R$-module. A proper submodule $N$ of $M$ is called a classical prime submodule, if for each $m\in M$ and elements $a,b\in R$, $abm\in N$ implies that $am\in N$…

Let $S$ be a semigroup, let $n\in\mathbb{N}$ be a positive natural number, let $A,B\subseteq S$, let $\mathcal{U},\mathcal{V}\in\beta S$ and let let $\mathcal{F}\subseteq\{f:S^{n}\rightarrow S\}$. We say that $A$ is $\mathcal{F}$-finitely…

Let $(X, f)$ be a topological dynamical system and $\mathcal {F}$ be a Furstenberg family (a collection of subsets of $\mathbb{N}$ with hereditary upward property). A point $x\in X$ is called an $\mathcal {F}$-transitive point if for every…

Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. For any positive integers $n$ and $k$, let $\binom{[n]}{k}$ denote…

Mubayi's Conjecture states that if $\mathcal{F}$ is a family of $k$-sized subsets of $[n] = \{1,\ldots,n\}$ which, for $k \geq d \geq 2$, satisfies $A_1 \cap\cdots\cap A_d \neq \emptyset$ whenever $|A_1 \cup\cdots\cup A_d| \leq 2k$ for all…

Given a Furstenberg family $\mathscr{F}$ of subsets of $\mathbb{N}$, an operator $T$ on a topological vector space $X$ is called $\mathscr{F}$-transitive provided for each non-empty open subsets $U$, $V$ of $X$ the set $\{n\in \mathbb{Z}_+…

Structural stability of holomorphic functions has been the subject of much research in the last fifty years. Due to various technicalities, however, most of that work has focused on so-called finite-type functions (functions whose set of…

We consider families of k-subsets of the standard n-set. Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all…

In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…

The role of symmetry in Boolean functions $f:\{0,1\}^n \to \{0,1\}$ has been extensively studied in complexity theory. For example, symmetric functions, that is, functions that are invariant under the action of $S_n$, is an important class…

Let $\mathcal{A}=\{A_{1},...,A_{p}\}$ and $\mathcal{B}=\{B_{1},...,B_{q}\}$ be two families of subsets of $[n]$ such that for every $i\in [p]$ and $j\in [q]$, $|A_{i}\cap B_{j}|= \frac{c}{d}|B_{j}|$, where $\frac{c}{d}\in [0,1]$ is an…

This paper deals with both complex dynamical systems and conformal iterated function systems. We study finitely generated expanding semigroups of rational maps with overlaps on the Riemann sphere. We show that if a $d$-parameter family of…

A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…

Clustering with submodular functions has been of interest over the last few years. Symmetric submodular functions are of particular interest as minimizing them is significantly more efficient and they include many commonly used functions in…

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…

Let $(\mathcal{F},\mathcal{G})$ be a pair of families of $[n]$, where $[n]=\{1,2,...,n\}$. If $A\not\subset B$ and $B\not\subset A$ hold for all $A\in\mathcal{F}$ and $B\in\mathcal{G}$, then $(\mathcal{F},\mathcal{G})$ is called a…

Two families $\mathcal{F}$ and $\mathcal{G}$ are called cross-intersecting if for every $F\in \mathcal{F}$ and $G\in \mathcal{G}$, the intersection $F\cap G$ is non-empty. It is significant to determine the maximum sum of sizes of…