Let $Δ$ be a simplicial complex of a matroid $M$. In this paper, we explicitly compute the regularity of all the symbolic powers of a Stanley-Reisner ideal $I_Δ$ in terms of combinatorial data of the matroid $M$. In order to do that, we provide a s...
This workshop about triangulations of manifolds in computational geometry and topology was held at the 2014 CG-Week in Kyoto, Japan. It focussed on computational and combinatorial questions regarding triangulations, with the goal of bringing togeth...
Transportation Network Companies employ dynamic pricing methods at periods of peak travel to incentivise driver participation and balance supply and demand for rides. Surge pricing multipliers are commonly used and are applied following demand and es...
The Quantum Alternating Operator Ansatz (QAOA) is a hybrid classical-quantum algorithm that aims to sample the optimal solution(s) of discrete combinatorial optimization problems. We present optimized QAOA circuit constructions for sampling MAX $k$-S...
Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network mino...
Adinkras are combinatorial objects developed to study supersymmetry representations. Gates et al. introduced the "gadget" as a function of pairs of adinkras, obtaining some mysterious results for $(n=4, k=1)$ adinkras with computer-aided computation....
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving quadratic in...
We present a formal analysis, in Isabelle/HOL, of optimisation algorithms for matroids, which are useful generalisations of combinatorial structures that occur in optimisation, and greedoids, which are a generalisation of matroids. Although some form...
The $k$-dimensional functional order property ($\text{FOP}_k$) is a combinatorial property of a $(k+1)$-partitioned formula. This notion arose in work of Terry and Wolf, which identified $\text{NFOP}_2$ as a ternary analogue of stability in the conte...
We introduce an idea called anti-gadgets in complexity reductions. These combinatorial gadgets have the effect of erasing the presence of some other graph fragment, as if we had managed to include a negative copy of a graph gadget. We use this idea t...
This paper investigates enumerative aspects of permutohedral blades, which provide a generalization of the notion of the tropical hyperplane arrangement. Blade provide the combinatorial underpinning of generalized biadjoint scalar scattering amplitud...
Combinatorial Designs, 15 (2): 98–119, CiteSeerX 10.1.1.151.3043, doi:10.1002/jcd.20105, S2CID 82321, Zbl 1112.05018 Raghavarao, Damaraju (1988), Constructions
Continuum models of plasticity fail to capture the richness of microstructural evolution because the continuum is a homogeneous construction. The present study shows that an alternative way is available at the mesoscale in the form of truly discrete...
Recently, Keith investigated reciprocals of false theta functions and proved some interesting results such as congruences, asymptotic bounds, and combinatorial identities. At the end of his paper, Keith posed a conjecture on congruences modulo 4 and...
In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these interpolation Mac...
The size and quality of chemical libraries to the drug discovery pipeline are crucial for developing new drugs or repurposing existing drugs. Existing techniques such as combinatorial organic synthesis and High-Throughput Screening usually make the p...
We give a combinatorial model for the exchange graph and g-vector fan associated to any acyclic exchange matrix B of affine type. More specifically, we construct a reflection framework for B in the sense of [N. Reading and D. E. Speyer, "Combinatoria...
Nim is a mathematical combinatorial game in which two players take turns removing (or "nimming") objects from distinct heaps or piles. On each turn, a