We introduce perturbative Feynman integrals in the context of q-calculus generalizing the Gaussian q-integrals introduced by Diaz and Teruel. We provide analytic as well as combinatorial interpretations for the Feynman-Jackson integrals....
We provide an explicit formula for the invariant of 4-manifolds introduced by Crane and Yetter (in hep-th 9301062). A consequence of our result is the existence of a combinatorial formula for the signature of a 4-manifold in terms of local data fro...
We study diffusion-based model predictive control (Diffusion-MPC) in discrete combinatorial domains using Tetris as a case study. Our planner samples candidate placement sequences with a MaskGIT-style discrete denoiser and selects actions via reranki...
We introduce a one-person game that we call Padlock Solitaire which resembles the well-known clock solitaire card game. Analyzing variants of this game we obtain simple proofs of some classical results of combinatorics including ballot theorems and t...
We study the relationship between the underlying structure of posets and the spectral and combinatorial properties of their higher-order random walks. While fast mixing of random walks on hypergraphs has led to myriad breakthroughs throughout theoret...
Higher order random walks (HD-walks) on high dimensional expanders (HDX) have seen an incredible amount of study and application since their introduction by Kaufman and Mass [KM16], yet their broader combinatorial and spectral properties remain poorl...
We consider learning of submodular functions from data. These functions are important in machine learning and have a wide range of applications, e.g. data summarization, feature selection and active learning. Despite their combinatorial nature, submo...
This paper addresses the problem of planning successive Space Debris Collecting missions so that they can be achieved at minimal cost by a generic vehicle. The problem mixes combinatorial optimization to select and order the debris among a list of ca...
We consider bounds on maximum nullity of a graph via transversal numbers of compatible collections of forts. Results include generalizations of theorems from symmetric to combinatorially symmetric matrices, special bases of matrix nullspaces derived...
We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. Using initial monomials, projections of the underlying vect...
This paper is the sequel of the paper under the same title with part 1, where we introduced refined canonical stable Grothendieck polynomials and their duals with two families of infinite parameters. In this paper we give combinatorial interpretation...
The notion of trees plays an important role in Butcher's B-series. More recently, a refined understanding of algebraic and combinatorial structures underlying the Magnus expansion has emerged thanks to the use of rooted trees. We follow these ideas b...
We give a combinatorial definition of the second parameter describing Sturmian words, that we call formal intercept, as an infinite Ostrowski expansion. We recall the well-known properties of Sturmian words, study factors graphs and repetition functi...
We give a direct combinatorial proof of the equidistribution of two pairs of permutation statistics, (des, aid) and (lec, inv), which have been previously shown to have the same joint distribution as (exc, maj), the major index and the number of exce...
We prove the combinatorial property of shortness for freehedra. Note that associahedra, a sibling family of polytopes, are not short....
In a Take-Away Game on hypergraphs, two players take turns to remove the vertices and the hyperedges of the hypergraphs. In each turn, a player must remove either a single vertex or a hyperedge. When a player chooses to remove one vertex, all of the...
We present a new, inductive construction of the Vietoris-Rips complex, in which we take advantage of a small amount of unexploited combinatorial structure in the $k$-skeleton of the complex in order to avoid unnecessary comparisons when identifying i...
We give topological characterizations of filters $F$ on $w$ such that the Mathias forcing $M_F$ adds no dominating reals or preserves ground model unbounded families. This allows us to answer some questions of Brendle, Guzmán, Hrušák, Martínez, M...
We study the Mathias--Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias--Prikry forcings with summable ideals are all mutually bi-embeddable....
We give completely combinatorial proofs of the main results of [3] using polygons. Namely, we prove that the mapping class group of a surface with boundary acts faithfully on a finitely-generated linear category. Along the way we prove some foundatio...