English
Related papers

Related papers: Borel combinatorics fail in HYP

200 papers

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…

Combinatorics · Mathematics 2025-10-23 Agelos Georgakopoulos

By work of Farinati, Solberg, and Taillefer, it is known that the Hopf algebra cohomology of a quasi-triangular Hopf algebra, as a graded Lie algebra under the Gerstenhaber bracket, is abelian. Motivated by the question of whether this…

Rings and Algebras · Mathematics 2022-04-20 Tekin Karadağ , Sarah Witherspoon

Let H stand for the set of homeomorphisms on [0,1]. We prove the following dichotomy for Borel subsets A of [0,1]: either there exists a homeomorphism f in H such that the image f(A) contains no 3-term arithmetic progressions; or, for every…

Dynamical Systems · Mathematics 2013-03-20 Michael Boshernitzan , Jon Chaika

A Taylor variety consists of all fixed order Taylor polynomials of rational functions, where the number of variables and degrees of numerators and denominators are fixed. In one variable, Taylor varieties are given by rank constraints on…

Algebraic Geometry · Mathematics 2023-04-04 Aldo Conca , Simone Naldi , Giorgio Ottaviani , Bernd Sturmfels

We are concerned with two separation theorems about analytic sets by Dyck and Preiss, the former involves the positively-defined subsets of the Cantor space and the latter the Borel-convex subsets of finite dimensional Banach spaces. We…

Logic · Mathematics 2017-03-21 Vassilios Gregoriades

Aslam presents an algorithm he claims will count the number of perfect matchings in any incomplete bipartite graph with an algorithm in the function-computing version of NC, which is itself a subset of FP. Counting perfect matchings is…

Computational Complexity · Computer Science 2009-05-15 Frank Ferraro , Garrett Hall , Andrew Wood

Using the theory of noncommutative symmetric functions, we introduce the higher order peak algebras, a sequence of graded Hopf algebras which contain the descent algebra and the usual peak algebra as initial cases (N = 1 and N = 2). We…

Combinatorics · Mathematics 2013-02-12 Daniel Krob , Jean-Yves Thibon

In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…

Combinatorics · Mathematics 2018-07-06 Dragan Mašulović , Bojana Pantić

Every beginning real analysis student learns the classic Heine-Borel theorem, that the interval [0,1] is compact. In this article, we present a proof of this result that doesn't involve the standard techniques such as constructing a…

History and Overview · Mathematics 2008-09-12 Matthew Macauley , Brian Rabern , Landon Rabern

Let R be a locally finitely generated algebra over a discrete valuation ring V of mixed characteristic. For any of the homological properties, the Direct Summand Theorem, the Monomial Theorem, the Improved New Intersection Theorem, the…

Commutative Algebra · Mathematics 2007-05-23 Hans Schoutens

The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.

Combinatorics · Mathematics 2018-07-17 Victor A. Vassiliev

We provide the first evidence for the inherent difficulty of finding complex sets with optimal proof systems. For this, we construct oracles $O_1$ and $O_2$ with the following properties, where $\mathrm{RE}$ denotes the class of recursively…

Computational Complexity · Computer Science 2025-07-03 Fabian Egidy , Christian Glaßer

We show that for every ordinal $\alpha \in [1, \omega_1)$ there is a closed set $F \subset 2^\omega \times \omega^\omega$ such that for every $x \in 2^\omega$ the section $\{y\in \omega^\omega; (x,y) \in F\}$ is a two-point set and $F$…

Logic · Mathematics 2020-10-07 P. Holicky , M. Zeleny

An $r$-uniform hypergraph $H$ is semi-algebraic of complexity $\mathbf{t}=(d,D,m)$ if the vertices of $H$ correspond to points in $\mathbb{R}^{d}$, and the edges of $H$ are determined by the sign-pattern of $m$ degree-$D$ polynomials.…

Combinatorics · Mathematics 2023-08-08 Zhihan Jin , István Tomon

We prove a structure theorem for Yetter-Drinfel'd Hopf algebras over groups of prime order that are nontrivial, cocommutative, and cosemisimple: Under certain assumptions on the base field, these algebras can be decomposed into a tensor…

Rings and Algebras · Mathematics 2009-09-25 Yorck Sommerhaeuser

Garret Birkhoff's HSP theorem characterizes the classes of models of algebraic theories as those being closed with respect to homomorphic images, subalgebras, and products. In particular, it implies that an algebra $\mathbf{B}$ satisfies…

Logic · Mathematics 2018-03-01 Friedrich Martin Schneider

Bell's theorem cannot be proved if complementary measurements have to be represented by random variables which cannot be added or multiplied. One such case occurs if their domains are not identical. The case more directly related to the…

Quantum Physics · Physics 2020-12-09 Marek Czachor

A well-known Peterson's theorem says that the number of abelian ideals in a Borel subalgebra of a rank-$r$ finite dimensional simple Lie algebra is exactly $2^r$. In this paper, we determine the dimensional distribution of abelian ideals in…

Quantum Algebra · Mathematics 2008-08-18 Li Luo

We investigate the class of bipartite Borel graphs organized by the order of Borel homomorphism. We show that this class is unbounded by finding a jump operator for Borel graphs analogous to a jump operator of Louveau for Borel equivalence…

Logic · Mathematics 2020-01-20 Adam R. Day , Andrew S. Marks

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

Combinatorics · Mathematics 2024-06-12 Hyunwoo Lee