English
Related papers

Related papers: On shattering, splitting and reaping partitions

200 papers

A partition $\Pi=\{S_1,\ldots,S_k\}$ of the vertex set of a connected graph $G$ is called a \emph{resolving partition} of $G$ if for every pair of vertices $u$ and $v$, $d(u,S_j)\neq d(v,S_j)$, for some part $S_j$. The \emph{partition…

Combinatorics · Mathematics 2018-11-13 Carmen Hernando , Mercè Mora , Ignacio M. Pelayo

The~\emph{Rothberger number} $\mathfrak{b} (\mathcal{I})$ of a definable ideal $\mathcal{I}$ on $\omega$ is the least cardinal $\kappa$ such that there exists a Rothberger gap of type $(\omega,\kappa)$ in the quotient algebra $\mathcal{P}…

Logic · Mathematics 2014-09-02 Jörg Brendle , Diego A. Mejía

We construct the $H$-von Neumann regular radical for $H$-module algebras and show that it is an $H$-radical property. We obtain that the Jacobson radical of twisted graded algebra is a graded ideal. For twisted $H$-module algebra $R$, we…

Quantum Algebra · Mathematics 2007-05-23 Shouchuan Zhang

We investigate several relations between cardinal characteristics of the continuum related with the asymptotic density of the natural numbers and some known cardinal invariants. Specifically, we study the cardinals of the form…

Logic · Mathematics 2025-06-27 David Valderrama

We show that (in ZFC) every infinite set S can be equipped with 2^|S| complete metrics which generate mutually non-homeomorphic scattered order topologies on S. Furthermore, we show that (in ZFC) every uncountable set S can be equipped with…

General Topology · Mathematics 2020-05-20 Gerald Kuba

A spatially varying blur kernel $h(\mathbf{x},\mathbf{u})$ is specified by an input coordinate $\mathbf{u} \in \mathbb{R}^2$ and an output coordinate $\mathbf{x} \in \mathbb{R}^2$. For computational efficiency, we sometimes write…

Signal Processing · Electrical Eng. & Systems 2024-03-12 Nicholas Chimitt , Xingguang Zhang , Yiheng Chi , Stanley H. Chan

A dominating set of a graph $G$ is a set of vertices $D$ such that for all $v \in V(G)$, either $v \in D$ or $(v,d) \in E(G)$ for some $d \in D$. The cardinality redundance of a vertex set $S$, $CR(S)$, is the number of vertices in $V(G)$…

Combinatorics · Mathematics 2019-06-10 Daniel McGinnis , Nathan Shank

The aim of this paper is to consider questions concerning the possible maximum cardinality of various separable pseudoradial (in short: SP) spaces. The most intriguing question here is if there is, in ZFC, a regular (or just Hausdorff) SP…

General Topology · Mathematics 2020-12-09 Alan Dow , Istvan Juhasz

Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholz-Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral…

Combinatorics · Mathematics 2021-03-22 Herbert Edelsbrunner , Katharina Ölsböck

A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…

Commutative Algebra · Mathematics 2022-02-09 Apoorva Khare , Akaki Tikaradze

For a positive integer $t \geq 2$, the $t$-core of a partition plays an important role in modular representation theory and combinatorics. We initiate the study of $t$-cores of partitions contained in an $r \times s$ rectangle. Our main…

Combinatorics · Mathematics 2024-04-30 Arvind Ayyer , Shubham Sinha

Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…

Logic · Mathematics 2025-09-15 Juan Pablo Aguilera , Joan Bagaria , Gabriel Goldberg , Philipp Lücke

Assume $\mathsf{ZF}+\mathsf{AD}+V=L(\mathbb{R})$ and let $\kappa<\Theta$ be an uncountable cardinal. We show that $\kappa$ is J\'onsson, and that if $\mathrm{cof}(\kappa)=\omega$ then $\kappa$ is Rowbottom. We also establish some other…

We show that the following two theories are equiconsistent: (T) ZFC, CH and "There is a dense ideal on the first uncountable cardinal such that if j is the generic embedding associated with it then its restriction on ordinals is independent…

Logic · Mathematics 2022-09-21 Dominik Adolf , Grigor Sargsyan , Nam Trang , Trevor Wilson , Martin Zeman

We define a Jordan homomorphism $\varphi$ from a ring $R$ to a ring $R'$ to be splittable if the ideal (of the subring generated by the image of $\varphi$) generated by all $\varphi(xy)-\varphi(x)\varphi(y)$, $x,y\in R$, has trivial…

Rings and Algebras · Mathematics 2024-10-10 Matej Brešar

A partition $\mathcal{P}$ of a weighted graph $G$ is $(\sigma,\tau,\Delta)$-sparse if every cluster has diameter at most $\Delta$, and every ball of radius $\Delta/\sigma$ intersects at most $\tau$ clusters. Similarly, $\mathcal{P}$ is…

Data Structures and Algorithms · Computer Science 2024-03-15 Arnold Filtser

This paper investigates a class of deterministic fractals whose construction is governed by arithmetic sequences. We introduce the essential fractal prime set P_{ess} , a variant of the Cantor set constructed using the sequence of prime…

General Mathematics · Mathematics 2026-05-26 Zhengqiang Li

Assume hat a functionally Hausdorff space $X$ is a continuous image of a \v{C}ech complete space $P$ with Lindel\"of number $l(P)<\mathfrak c$. Then the following conditions are equivalent: (i) every compact subset of $X$ is scattered, (ii)…

General Topology · Mathematics 2021-11-01 Taras Banakh , Bogdan Bokalo , Vladimir Tkachuk

In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…

Combinatorics · Mathematics 2007-05-23 Masao Ishikawa

A graph is h-perfect if its stable set polytope can be completely described by non-negativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4. For every graph $G$ and every…

Combinatorics · Mathematics 2014-06-04 Yohann Benchetrit