相关论文: Structured Sunflowers
We combine here Tao's slice-rank bounding method and Gr\"obner basis techniques and apply here to the Erd\H{o}s-Rado Sunflower Conjecture. Let $\frac{3k}{2}\leq n\leq 3k$ be integers. We prove that if $\mbox{$\cal F$}$ be a $k$-uniform…
Sunflowers, or $\Delta$-systems, are a fundamental concept in combinatorics introduced by Erd\H{o}s and Rado in their paper: {\em Intersection theorems for systems of sets}, J. Lond. Math. Soc. (1) {\bf 35} (1960), 85--90. A sunflower is a…
We define a `tree of fusion systems' and give a sufficient condition for its completion to be saturated. We apply this result to enlarge an arbitrary fusion system by extending the automorphism groups of certain of its subgroups.
The formal class of a germ of diffeomorphism $\phi$ is embeddable in a flow if $\phi$ is formally conjugated to the exponential of a germ of vector field. We prove that there are complex analytic unipotent germs of diffeomorphisms at…
Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…
A subset $B \subset Y$ is constructible if it is an element of the smallest family that contains all open sets and is stable under finite intersections and complements. A function $f : X \to Y$ is said to be piece-wise closed if $X$ can be…
A similarity structure on a connected manifold M is a Riemannian metric on its universal cover such that the fundamental group of M acts by similarities. If the manifold M is compact, we show that the universal cover admits a de Rham…
We show that a family $\mathcal{F}$ of sets each of cardinality $m \in \mathbb{Z}_{>2}$ includes a $k$-sunflower if $ |\mathcal{F}| \ge \left( \frac{c k^2 \ln m}{\ln \ln m} \right)^m$ for some constant $c>0$, where $k$-sunflower means a…
We prove that a function definable with parameters in an o-minimal structure is bounded away from infinity as its argument goes to infinity by a function definable without parameters, and that this new function can be chosen independently…
According to Bestvina-Bromberg-Fujiwara, a finitely generated group is said to have property (QT) if it acts isometrically on a finite product of quasi-trees so that orbital maps are quasi-isometric embeddings. We prove that the fundamental…
A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…
We show that manifolds which parameterize values of first integrals of integrable finite-dimensional bihamiltonian systems carry a geometric structure which we call a {\em Kronecker web}. We describe two functors between Kronecker webs and…
We demonstrate that for the $k$-variable theory $T$ of a finite structure (satisfying certain amalgamation conditions), if finite models of $T$ can be recovered from diagrams of finite {\em subsets} of model of $T$ in a certain "efficient"…
An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…