We discuss a categorical approach to the theory of discriminants in the combinatorial language introduced by Gelfand, Kapranov and Zelevinsky. Our point of view is inspired by homological mirror symmetry and provides $K$--theoretic evidence for a con...
This monograph is a comprehensive study of the combinatorial structure of various operads of wiring diagrams and undirected wiring diagrams. Our first main objective is to prove a finite presentation theorem for each operad of wiring diagrams, descri...
We propose a new approach for solving combinatorial optimization problem by utilizing the mechanism of chases and escapes, which has a long history in mathematics. In addition to the well-used steepest descent and neighboring search, we perform a cha...
This article serves as an introduction to several recent developments in the study of quasisymmetric functions. The focus of this survey is on connections between quasisymmetric functions and the combinatorial Hopf algebra of noncommutative symmetric...
Jun 26, 2017 · Always use blocking assignments for combinatorial or level-sensitive code, as well a clock assignments Always use non-blocking assignments for variables that are written on a clock …
This note defines a flag vector for $i$-graphs. The construction applies to any finite combinatorial object that can be shelled. Two possible connections to quantum topology are mentioned. Further details appear in the author's "On quantum topology...
We present new probabilistic and combinatorial identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic identities, re...
The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Miklös and Singhi. We study the fundamentals properties of such lattices and of a particular c...
The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton-Strahler number of stable Galton-Watson trees conditioned to have siz...
We derive the combinatorial representations of Picard group and deformation space of anti-canonical hypersurfaces of a toric variety using techniques in toric geometry. The mirror cohomology correspondence in the context of mirror symmetry is establi...
We use valid inequalities (cuts) of the binary integer program for winner determination in a combinatorial auction (CA) as "artificial items" that can be interpreted intuitively and priced to generate Artificial Walrasian Equilibria. While the lack o...
This paper is the third in a series which explores a combinatorial method for generating lattice polygons in the plane. I call this method the plaid model. In this paper I prove the main result I had been aiming for since the beginning, which is to...
As an attempt to bridge the gap between the probabilistic world of classical information theory and the combinatorial world of zero-error information theory, this paper studies the performance of randomly generated codebooks over discrete memoryless...
We present the basic concepts of tensor products of vector spaces, emphasizing linear algebraic and combinatorial techniques as needed for applied areas of research. The topics include (1) Introduction; (2) Basic multilinear algebra; (3) Tensor produ...
The On-Line Encyclopedia Of Integer Sequences , that wonderful resource that most combinatorialists, and many other mathematicians and scientists, use at least once a day, is a treasure trove of mathematical information, and, one of its charms is tha...
Jun 3, 2025 · The Technology Convergence Report 2025 offers leaders a strategic lens – the 3C Framework – to help them navigate the combinatorial innovation era.
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm proposed for Noisy Intermediate-Scale Quantum (NISQ) devices and is regarded as a promising approach to combinatorial optimization problems, with potential applications in t...
Given a set $Σ$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $ρ_1,ρ_2,...,ρ_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(Σ)$ of $Σ$ is $Θ(\sum_{1\le{...
Cumulative Games were introduced by Larsson, Meir, and Zick (2020) to bridge some conceptual and technical gaps between Combinatorial Game Theory (CGT) and Economic Game Theory. The partizan ruleset {\sc Robin Hood} is an instance of a Cumulative Gam...
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and the decor...