English
Related papers

Related papers: Comparing the closed almost disjointness and domin…

200 papers

We prove that the composition of a quasi-nearly subharmonic function and a quasiregular mappings of bounded multiplicity is quasi-nearly subharmonic. Also, we prove that if $u\circ f$ is quasi-nearly subharmonic for all quasi-nearly…

Functional Analysis · Mathematics 2011-03-09 Pekka Koskela , Vesna Manojlović

Let $G=(V, E)$ be a simple and undirected graph. For some integer $k\geq 1$, a set $D\subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at least $k$ neighbors in $D$. Furthermore, for some real…

Computational Complexity · Computer Science 2017-02-03 Davood Bakhshesh , Mohammad Farshi , Mahdieh Hasheminezhad

Let $\mathcal{A}_1,\ldots,\mathcal{A}_m$ be families of $k$-subsets of an $n$-set. Suppose that one cannot choose pairwise disjoint edges from $s+1$ distinct families. Subject to this condition we investigate the maximum of…

Combinatorics · Mathematics 2021-05-04 Peter Frankl , Jian Wang

We survey results regarding the definability and size of maximal discrete sets in analytic hypergraphs. Our main examples include maximal almost disjoint (or mad) families, $\mathcal I$-mad families, maximal eventually different families,…

Logic · Mathematics 2021-01-01 David Schrittesser

Any gentle algebra $A$ with one maximal path corresponds to a unique quasi-diagram $\alpha$. We introduce the regularity for $\alpha$, and show that $A$ has finite global dimension if and only if $\alpha$ is regular. We characterize regular…

Rings and Algebras · Mathematics 2024-03-07 Haigang Hu , Xiao-Chuang Wang , Yu Ye

The multiplicity (resp. degree) of a function $f$ relative to a semianalytic subset $S$ of $\mathbb{R}^n$ is the greatest (resp. smallest) exponent among numbers $j$ such that the inequality $|f(x)|\leq C\|x\|^j$ holds on $S$ near $0$…

Algebraic Geometry · Mathematics 2019-10-14 Vincent Grandjean , Maria Michalska

We study families of subsets of $\omega$ which are independent with respect to the asymptotic density $\mathsf{d}$. We show, for instance, that there exists a maximal $\mathsf{d}$-independent family $\mathcal{A}$ such that…

Logic · Mathematics 2026-04-01 Jonathan M. Keith , Paolo Leonetti

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…

Logic · Mathematics 2021-02-09 Howard Becker , Randall Dougherty

For g < f in omega^omega we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force aleph_1 many different values for different functions…

Logic · Mathematics 2016-09-06 Martin Goldstern , Saharon Shelah

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

Number Theory · Mathematics 2007-05-23 László Tóth , Eduard Wirsing

In a directed graph $D$, a vertex subset $S\subseteq V$ is a total dominating set if every vertex of $D$ has an in-neighbor from $S$. A total dominating set exists if and only if every vertex has at least one in-neighbor. We call the…

Combinatorics · Mathematics 2024-11-08 Zoltán L. Blázsik , Leila Vivien Nagy

We show that there is some absolute constant $c>0$, such that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}$, if \mbox{$|\mathcal{F}| \geq (\frac{1}{2}-c)2^n$}, then there is some element $i \in [n]$ that appears in at least…

Combinatorics · Mathematics 2017-08-07 Ilan Karpas

A MAD (maximal almost disjoint) family is an infinite subset A of the infinite subsets of {0,1,2,..} such that any two elements of A intersect in a finite set and every infinite subset of {0.1.2...} meets some element of $\aa$ in an…

Logic · Mathematics 2007-05-23 Arnold W. Miller

We prove the consistency of $\binom{\mu^+}{\mu}\nrightarrow\binom{\mu^+ \omega_1}{\mu\ \mu}$ where $\mu$ is a strong limit singular cardinal of countable cofinality. This result can be forced at limit of measurable cardinals and at small…

Logic · Mathematics 2021-02-02 Shimon Garti

We show the existence of an absolute constant $\alpha>0$ such that, for every $k \geq 3$, $G:=\mathop{\mathrm{Sym}}(k)$, and for every $H \leqslant G$ of index at least $3$, one has $|H/[H,H]| \leq |G:H|^{\alpha/ \log \log |G:H|}$. This…

Group Theory · Mathematics 2022-01-11 Luca Sabatini

Let $S$ be a family of sequences of positive numbers that decrease to 0, let $X$ be a metric space and $A \subset X$. $A$ is said to be $S$-dominated if, for every $s\in S$, a countable cover $\{E_n\}$ of $E$ can be found such that $diam…

Classical Analysis and ODEs · Mathematics 2026-03-23 Ondřej Zindulka , Piotr Nowakowski

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ which leaves invariant each…

Group Theory · Mathematics 2021-02-15 Dmitry Churikov , Cheryl E. Praeger

The article focuses on a class of second countable groups assembled from profinite and discrete by elementary operations. We focus on a rank associated with these groups that measure their complexity, the decomposition rank. A collection of…

Group Theory · Mathematics 2023-10-23 João V. P. e Silva

We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…

Group Theory · Mathematics 2021-06-28 Uwe Schauz

Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…

Group Theory · Mathematics 2018-02-23 Igor Lima , Martino Garonzi
‹ Prev 1 3 4 5 6 7 10 Next ›