English
Related papers

Related papers: Evasion and prediction II

200 papers

The $k$-representation number of a graph $G$ is the minimum cardinality of the system of vertex subsets with the property that every edge of $G$ is covered at least $k$ times while every non-edge is covered at most $(k-1)$ times. In…

Combinatorics · Mathematics 2024-03-05 Ayush Basu , Vojtěch Rödl , Marcelo Sales

The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and…

Combinatorics · Mathematics 2010-09-06 Matt DeVos , Bojan Mohar , Robert Samal

Let K be an abstract elementary class satisfying the joint embedding and the amalgamation properties. Let m be a cardinal above the the L\"owenheim-Skolem number of the class. Suppose K satisfies the disjoint amalgamation property for limit…

Logic · Mathematics 2015-02-09 R. Grossberg , M. VanDieren , A. Villaveces

We prove that, under suitable assumptions on a category C, the existence of supercompact cardinals implies that every absolute epireflective class of objects of C is a small-orthogonality class. More precisely, if L is a localization…

Category Theory · Mathematics 2007-05-23 Joan Bagaria , Carles Casacuberta , Adrian R. D. Mathias

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

Combinatorics · Mathematics 2022-01-28 John T. Baldwin

In this paper, we obtain the consistency, relative to large cardinals, of the existence of dense ideals on every successor of a regular cardinal simultaneously. Using a consequent transfer principle, we show that in this model there is a…

Logic · Mathematics 2024-10-21 Monroe Eskew , Yair Hayut

We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'{e}di-Gowers theorem: For any $K\geq 1$ and $\varepsilon > 0$, there exists $\delta = \delta(K,\varepsilon)>0$ such that the following…

Combinatorics · Mathematics 2019-09-09 Xuancheng Shao

We investigate the \textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge…

Combinatorics · Mathematics 2017-12-01 Marcin Anholcer , Sylwia Cichacz

Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a uniform lattice in $G$, and let $O$ be an open subset of $X$. We give an upper estimate for the Hausdorff dimension of the set of points whose trajectories escape $O$ on average…

Dynamical Systems · Mathematics 2023-10-03 Dmitry Kleinbock , Shahriar Mirzadeh

In [CMRM24], it was proved that it is relatively consistent that \emph{bounding number} $\mathfrak{b}$ is smaller than the uniformity of $\mathcal{MA}$, where $\mathcal{MA}$ denotes the ideal of the meager-additive sets of $2^{\omega}$. To…

Logic · Mathematics 2025-03-14 Miguel A. Cardona

Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes…

Data Structures and Algorithms · Computer Science 2024-08-08 Vishesh Jain , Clayton Mizgerd

We show that every Abelian group satisfying a mild cardinal inequality admits a pseudocompact group topology from which all countable subgroups inherit the maximal totally bounded topology (we say that such a topology satisfies property…

Group Theory · Mathematics 2010-05-14 Jorge Galindo , Sergio Macario

Let M denote the ideal of first category subsets of R. We prove that min{card X: X \subseteq R, X \not\in M} is the smallest cardinality of a family S \subseteq {0,1}^\omega with the property that for each f: \omega -> \bigcup_{n \in…

Logic · Mathematics 2007-05-23 Apoloniusz Tyszka

In this paper, we are motivated by the conjectures proposed by C.~Bender \textit{et al.}, \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove…

Combinatorics · Mathematics 2026-04-20 Anagha Khiste , Ganesh Tarte , Vinayak Joshi

For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written…

Combinatorics · Mathematics 2011-09-19 Elliot Krop

In this paper we prove a new generic vanishing theorem for $X$ a complete homogeneous variety with respect to an action of a connected algebraic group. Let $A, B_0\subset X$ be locally closed affine subvarieties, and assume that $B_0$ is…

Algebraic Geometry · Mathematics 2023-03-27 Jörg Schürmann , Connor Simpson , Botong Wang

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…

Combinatorics · Mathematics 2025-07-08 Peter Allen , Julia Böttcher , Yoshiharu Kohayakawa , Mihir Neve

Let $S$ be a subset of $\mathbb{R}^d$ with finite positive Lebesgue measure. The Beer index of convexity $\operatorname{b}(S)$ of $S$ is the probability that two points of $S$ chosen uniformly independently at random see each other in $S$.…

Metric Geometry · Mathematics 2016-12-30 Martin Balko , Vít Jelínek , Pavel Valtr , Bartosz Walczak

We show that the minimum $h_{\text{min}}$ of the stable Faltings height on elliptic curves found by Deligne is followed by a gap. This means that there is a constant $C >0$ such that for every elliptic curve $E/K$ with everywhere semistable…

Number Theory · Mathematics 2015-12-17 Steffen Löbrich

The celebrated Erdos-Hajnal conjecture states that for every $n$-vertex undirected graph $H$ there exists $\eps(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or an independent set of size…

Combinatorics · Mathematics 2015-08-06 Krzysztof Choromanski , Dvir Falik , Anita Liebenau , Viresh Patel , Marcin Pilipczuk