English
Related papers

Related papers: Erd\H{o}s--Ko--Rado and Hilton--Milner theorems fo…

200 papers

We describe a standard form for the elements in the universal field of fractions of free associative algebras (over a commutative field). It is a special version of the normal form provided by Cohn and Reutenauer and enables the use of…

Rings and Algebras · Mathematics 2020-12-09 Konrad Schrempf

We study non-associative twisted group algebras over $(\Z_2)^n$ with cubic twisting functions. We construct a series of algebras that extend the classical algebra of octonions in the same way as the Clifford algebras extend the algebra of…

Rings and Algebras · Mathematics 2015-05-18 Sophie Morier-Genoud , Valentin Ovsienko

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

Combinatorics · Mathematics 2015-01-29 Pierre Aboulker , Guillaume Lagarde , David Malec , Abhishek Methuku , Casey Tompkins

Coinduction occurs in two guises in Horn clause logic: in proofs of self-referencing properties and relations, and in proofs involving construction of (possibly irregular) infinite data. Both instances of coinductive reasoning appeared in…

Logic in Computer Science · Computer Science 2018-09-14 Ekaterina Komendantskaya Dr , Yue Li

The celebrated Erd\H{o}s-Ko-Rado (EKR) theorem for Paley graphs (of square order) states that all maximum cliques are canonical in the sense that each maximum clique arises from the subfield construction. Recently, Asgarli and Yip extended…

Combinatorics · Mathematics 2024-02-02 Chi Hoi Yip

A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…

Combinatorics · Mathematics 2024-09-24 Alexey Pokrovskiy

We extend the notion of connection in order to be able to study singular geometric structures, namely, we consider a notion of connection on a Lie algebroid which is a natural extension of the usual concept of connection. Using connections,…

Differential Geometry · Mathematics 2007-05-23 Rui Loja Fernandes

In this note, we establish Andr\'{a}sfai--Erd\H{o}s--S\'{o}s-type stability theorems for two generalized Tur\'{a}n problems involving odd cycles, both of which are extensions of the Erd\H{o}s Pentagon Problem. Our results strengthen…

Combinatorics · Mathematics 2024-09-19 Zian Chen , Jianfeng Hou , Caiyun Hu , Xizhi Liu

We describe the modulo $2$ de Rham-Witt complex of a field of characteristic $2$, in terms of the powers of the augmentation ideal of the $\mathbb{Z}/2$-geometric fixed points of real topological restriction homology TRR. This is analogous…

Algebraic Topology · Mathematics 2025-05-28 Emanuele Dotto

The interplay between derivations and algebraic structures has been a subject of significant interest and exploration. Inspired by Yau's twist and the Leibniz rule, we investigate the formal deformation of twisted Lie algebras by invertible…

Rings and Algebras · Mathematics 2024-06-21 I. Basdouri , E. Peyghan , M. A. Sadraoui , R. Saha

In this paper we show that to each planar line arrangement defined over the real numbers, for which no two lines are parallel, one can write down a corresponding relation on Dehn twists that can be read off from the combinatorics and…

Geometric Topology · Mathematics 2012-01-10 Eriko Hironaka

The Milnor conjecture has been a driving force in the theory of quadratic forms over fields, guiding the development of the theory of cohomological invariants, ushering in the theory of motivic cohomology, and touching on questions ranging…

Algebraic Geometry · Mathematics 2014-06-17 Asher Auel

An important combinatorial result in equivariant cohomology and $K$-theory Schubert calculus is represented by the formulas of Billey and Graham-Willems for the localization of Schubert classes at torus fixed points. These formulas work…

Algebraic Geometry · Mathematics 2017-11-01 Cristian Lenart , Kirill Zainoulline

We make a short review of the formalism that describes Higgs and Yang Mills fields as two particular cases of an appropriate generalization of the notion of connection. We also comment about the several variants of this formalism, their…

High Energy Physics - Theory · Physics 2015-06-26 G. Cammarata , R. Coquereaux

A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…

Combinatorics · Mathematics 2018-10-30 Václav Rozhoň

In this note, we use the concept of a polynomial ring to give an elementary proof to Cayley-Hamilton Theorem. We also give an elementary proof to Birkhoff theorem on Bi-stochastic matrices.

History and Overview · Mathematics 2019-12-10 Yifan Ren , Tongsuo Wu

We introduce Auslander-Reiten sequences for group algebras and give several recent applications. The first part of the paper is devoted to some fundamental problems in Tate cohomology which are motivated by homotopy theory. In the second…

Representation Theory · Mathematics 2009-12-03 Sunil Chebolu , Ján Mináč

The study of intersecting structures is central to extremal combinatorics. A family of permutations $\mathcal{F} \subset S_n$ is \emph{$t$-intersecting} if any two permutations in $\mathcal{F}$ agree on some $t$ indices, and is…

Combinatorics · Mathematics 2015-01-12 József Balogh , Shagnik Das , Michelle Delcourt , Hong Liu , Maryam Sharifzadeh

A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be cross-intersecting if each set in $\mathcal{A}$ intersects each set in…

Combinatorics · Mathematics 2017-06-20 Peter Borg

The classical Erd\H os-Ko-Rado (EKR) Theorem states that if we choose a family of subsets, each of size (k), from a fixed set of size (n (n > 2k)), then the largest possible pairwise intersecting family has size (t ={n-1\choose k-1}). We…

Combinatorics · Mathematics 2012-04-12 Anna Celaya , Anant P. Godbole , Mandy Rae Schleifer