University of Illinois System

output

19922026

most citedThe automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations

7.9k citations

Showing math.COShow all

40 papers · 1 filter

math.CO2025

Hypergraphs without complete partite subgraphs

Dhruv Mubayi

Fix integers $r \geq 2$ and $1 \leq s_{1} \leq \dots \leq s_{r - 1} \leq t$ and set $s = \prod_{i = 1}^{r - 1} s_{i}$ . Let $K = K (s_{1}, \dots, s_{r - 1}, t)$ denote the complete $r$ -partite $r$ -uniform hy…

math.CO2023★ 2 cited

Weighted Turán theorems with applications to Ramsey-Turán type of problems

József Balogh, Domagoj Bradač, Bernard Lidický

We study extensions of Turán Theorem in edge-weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique…

math.CO2020★ 1 cited

Convex geometries representable by at most 5 circles on the plane

PolyMath REU Convex Geometries Collaboration, Kira Adaricheva, Madina Bolat +18

A convex geometry is a closure system satisfying the anti-exchange property. In this work we document all convex geometries on 4- and 5-element base sets with respect to their repr…

math.CO2019★ 6 cited

Twenty-Vertex model with domain wall boundaries and domino tilings

Philippe Di Francesco, Emmanuel Guitter

We consider the triangular lattice ice model (20-Vertex model) with four types of domain-wall type boundary conditions. In types 1 and 2, the configurations are shown to be equinum…

math.CO2017★ 2 cited

An improved lower bound for Folkman's theorem

József Balogh, Sean Eberhard, Bhargav Narayanan +2

Folkman's Theorem asserts that for each $k \in N$ , there exists a natural number $n = F (k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $…

math.CO2016★ 2 cited

Super-Walk Formulae for Even and Odd Laplacians in Finite Graphs

Chengzheng Yu

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with…