中文
相关论文

相关论文: Structured Sunflowers

200 篇论文

We prove equivalence of certain axiom sets for affine buildings. Along the lines a purely combinatorial proof of the existence of a spherical building at infinity is given. As a corollary we obtain that ``being an affine building'' is…

群论 · 数学 2009-09-17 Petra N. Schwer

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

度量几何 · 数学 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

逻辑 · 数学 2024-05-31 Adrián Portillo Fernández

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

逻辑 · 数学 2026-01-19 Joey Lakerdas-Gayle

Let $\mathscr{S}$ be the class of all structures whose growth rate on orbits of subsets of size $n$ is not faster than $\frac{2^n}{p(n)}$ for any polynomial $p$. In this article we give a complete classification of all structures in…

逻辑 · 数学 2025-07-24 Bertalan Bodor

For a family $\mathcal{H} \subseteq \binom{[n]}{k}$, a subset $\{A_1, A_2, \ldots, A_m\} \subseteq \mathcal{H}$ is called a \textit{matching} of size~$m$ if the sets $A_1, A_2, \ldots, A_m$ are pairwise disjoint. The \textit{matching…

组合数学 · 数学 2026-04-24 Haixiang Zhang , Mengyu Cao , Mei Lu

The Erd\H{o}s--Rado sunflower problem admits two natural analogues in finite vector spaces, corresponding to two different ways of generalising the set-theoretic notion of a sunflower. The first, used by Ihringer and Kupavskii [FFA 110…

组合数学 · 数学 2026-05-13 Kamil Otal

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…

计算机科学中的逻辑 · 计算机科学 2011-11-15 Alex Spelten , Wolfgang Thomas , Sarah Winter

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

逻辑 · 数学 2018-12-07 Miloš S. Kurilić

In previous work we proved that, for categories of free finite-dimensional modules over a commutative semiring, linear compact-closed symmetric monoidal structure is a property, rather than a structure. That is, if there is such a…

量子物理 · 物理学 2019-01-30 Stefano Gogioso , Dan Marsden , Bob Coecke

A family of $r$ distinct sets $\{A_1,\ldots, A_r\}$ is an $r$-sunflower if for all $1 \leqslant i < j \leqslant r$ and $1 \leqslant i' < j' \leqslant r$, we have $A_i \cap A_j = A_{i'} \cap A_{j'}$. Erd\H{o}s and Rado conjectured in 1960…

组合数学 · 数学 2025-09-25 József Balogh , Anton Bernshteyn , Michelle Delcourt , Asaf Ferber , Huy Tuan Pham

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

组合数学 · 数学 2010-12-01 Norbert Sauer

In the paper hereditary classes of ${\rm L}$-structures are studied with language of the form ${{\rm L} = {\rm L_{fin}} \cup {\rm L_\infty}}$, where ${{\rm L_{fin}} = \langle R_1,R_2,\ldots, R_m, = \rangle}$ and ${{\rm L_\infty} = \langle…

逻辑 · 数学 2023-12-29 Artem Ilev

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

逻辑 · 数学 2012-10-30 Cameron Donnay Hill

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

逻辑 · 数学 2016-11-04 Mohammad Assem

Let $\Delta$ be a spherical building each of whose irreducible components is infinite, has rank at least 2 and satisfies the Moufang condition. We show that $\Delta$ can be given the structure of a topological building that is compact and…

We consider holomorphic foliations by curves on compact complex manifolds, for which we investigate the existence of projective structures along the leaves varying holomorphically (foliated projective structures), that satisfy particular…

复变函数 · 数学 2026-01-13 Bertrand Deroin , Adolfo Guillot

We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…

Let M be an o-minimal structure with elimination of imaginaries, N an unstable structure definable in M. Then there exists X, interpretable in N, such that X with all the structure induced from N is o-minimal. In particular X is linearly…

逻辑 · 数学 2007-05-23 Assaf Hasson , Alf Onshuus

Let $\Omega_1,\Omega_2$ be two disjoint open sets in $\mathbf C^n$ whose boundaries share a smooth real hypersurface $M$ as relatively open subsets. Assume that $\Omega_i$ is equipped with a complex structure $J^i$ which is smooth up to…

复变函数 · 数学 2010-08-09 Florian Bertrand , Xianghong Gong , Jean-Pierre Rosay