相关论文: The Refined Lecture Hall Theorem via Abacus Diagra…

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…

Taking up the challenge McConnell laid down at the end of his proof of the law of cosines, we give a completely visual dissection proof of this theorem, which applies to any triangle. In order to avoid the trigonometric expressions of…

Leonid Levin (arxiv.org/abs/cs/0503039v14, p.7) published a new (and very nice) proof of G\'acs-Ku\v{c}era's theorem that occupies only a few lines when presented in his style. We try to explain more details and discuss the connection of…

We use Naito-Sagaki's work [S. Naito & D. Sagaki, J. Algebra 245 (2001) 395--412, J. Algebra 251 (2002) 461--474] on Lakshmibai-Seshadri paths fixed by diagram automorphisms to study the partitions fixed by Mullineux involution. We…

B\'ezout's theorem, nonequivariantly, can be interpreted as a calculation of the Euler class of a sum of line bundles over complex projective space, expressing it in terms of the rank of the bundle and its degree. We give here a…

This paper presents a simple proof of Dekel (1986)'s representation theorem for betweenness preferences. The proof is based on the separation theorem.

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…

We prove multiple generalizations of Fan's combinatorial labeling result for sphere triangulations. This can be seen as a comprehensive extension of the Borsuk--Ulam theorem. In typical applications, the Borsuk--Ulam theorem gives…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…

We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

This paper is an extension program of the notion of circle of partition developed in our first paper \cite{CoP}. As an application we prove the Erd\H{o}s-Tur\'{a}n additive base conjecture.

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…

I connect an old result of mine on a Lie algebra generalization of the Amitsur-Levitski theorem with equations for sheets in a reductive Lie algebra and with recent results of Kostant-Wallach on the variety of singular elements in a…

We give a combinatorial proof of a theorem of Gromov, which extends the scope of small cancellation theory to group presentations arising from labelled graphs.

We show that various classical theorems of real/complex linear incidence geometry, such as the theorems of Pappus, Desargues, M\"obius, and so on, can be interpreted as special cases of a single "master theorem" that involves an arbitrary…

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…