中文
相关论文

相关论文: Covering an uncountable square by countably many c…

200 篇论文

A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…

组合数学 · 数学 2021-10-12 Michael Haythorpe , Alex Newcombe

Merker conjectured that if $k \ge 2$ is an integer and $G$ a 3-connected cubic planar graph of circumference at least $k$, then the set of cycle lengths of $G$ must contain at least one element of the interval $[k, 2k+2]$. We here prove…

组合数学 · 数学 2020-09-02 Carol T. Zamfirescu

Inspired by Menshov's representation theorem, we prove that there exists a sequence of frequecies such that any measurable (complex valued) function on R can be represented as a sum of almost everywhere convergent trigonometric series with…

经典分析与常微分方程 · 数学 2007-05-23 Gady Kozma , Alexander Olevskii

We show that pairs of generators for the family Sz(q) of Suzuki groups may be selected so that the corresponding Cayley graphs are expanders. By combining this with several deep works of Kassabov, Lubotzky and Nikolov, this establishes that…

群论 · 数学 2010-05-06 Emmanuel Breuillard , Ben Green , Terence Tao

The $\mathbb{G}_0$-dichotomy due to Kechris, Solecki and Todor\vcevi\'c characterizes the analytic relations having a Borel-measurable countable coloring. We give a version of the $\mathbb{G}_0$-dichotomy for $\boraxi$-measurable countable…

逻辑 · 数学 2011-04-27 Dominique Lecomte , Miroslav Zeleny

We prove that, if f:R^n\to R satisfies Fr\'echet's functional equation and f(x_1,...,x_n) is not an ordinary algebraic polynomial in the variables x_1,...,x_n, then f is unbounded on all non-empty open set U of R^n. Furthermore, the closure…

经典分析与常微分方程 · 数学 2014-01-21 J. M. Almira , Kh. F. Abu-Helaiel

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

逻辑 · 数学 2022-02-22 Assaf Rinot , Jing Zhang

In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…

逻辑 · 数学 2026-03-23 Mahmood Etedadialiabadi , Su Gao , Feng Li , Ruiwen Li

We study the coset covering function $\mathfrak{C}(r)$ of a finitely generated group: the number of cosets of infinite index subgroups needed to cover the ball of radius $r$. We show that $\mathfrak{C}(r)$ is of order at least $\sqrt{r}$…

群论 · 数学 2024-05-01 Elia Gorokhovsky , Nicolás Matte Bon , Omer Tamuz

Dimensional types of metric scattered spaces are investigated. Revised proofs of Mazurkiewicz-Sierpi\'nski and Knaster-Urbanik theorems are presented. Embeddable properties of countable metric spaces are generalized onto uncountable metric…

一般拓扑 · 数学 2015-05-01 Szymon Plewik , Marta Walczyńska

By considering appropriate finite covering spaces of closed non-orientable surfaces, we construct linear representations of their mapping class group which have finite index image in certain big arithmetic groups.

几何拓扑 · 数学 2014-02-20 Ferit Deniz , Wilhelm Singhof

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

组合数学 · 数学 2026-05-13 Václav Blažej , Michał Pilipczuk , Evangelos Protopapas

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…

组合数学 · 数学 2016-08-24 Marcin Wrochna

We show, for every $r>d\ge 0$ or $r=d\ge 2$, the existence of a Baire generic set of $C^d$-families of $C^r$-maps $(f_a)_{a\in (-1,1)^k}$ of a manifold $M$ of dimension $\ge 2$, so that for every $a$ small the map $f_a$ has infinitely many…

动力系统 · 数学 2015-09-30 Pierre Berger

A reconstruction problem is formulated for Sperner systems, and infinite families of nonreconstructible Sperner systems are presented. This has an application to a reconstruction problem for functions of several arguments and identification…

组合数学 · 数学 2016-11-22 Miguel Couceiro , Erkko Lehtonen , Karsten Schölzel

We study families of self-adjoint operators with given spectra whose sum is a scalar operator. Such families are $*$-representations of certain algebras which can be described in terms of graphs and positive functions on them. The main…

表示论 · 数学 2007-05-23 Vasyl Ostrovskyi

A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective…

组合数学 · 数学 2015-05-07 Tomáš Kaiser , Matěj Stehlík

In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…

组合数学 · 数学 2025-10-23 Agelos Georgakopoulos

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

逻辑 · 数学 2017-01-06 Hakim J. Walker

In this paper, among other things, we prove that any subset of $\overline{\mathbb{Q}}^m$ (closed under complex conjugation and which contains the origin) is the exceptional set of uncountable many transcendental entire functions over…

数论 · 数学 2024-11-20 Diego Alves , Jean Lelis , Diego Marques , Pavel Trojovský
‹ 上一页 1 8 9 10 下一页 ›