Ask HN: Why did AlphaProof fail at IMO combinatorial problems?
Points: 4 | Comments: 2 | Author: ckcheng
Launch HN: OneChronos (YC S16) – Combinatorial auctions market for US equities
Points: 231 | Comments: 118 | Author: lpage
Combinatorial map - Wikipedia
A combinatorial map is a combinatorial representation of a graph on an orientable surface. A combinatorial map may also be called a combinatorial embedding
Some Combinatorial Identities some of which involving Harmonic Numbers
A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving classical harmo...
Framed Combinatorial Topology with Labels in $\infty$-Categories
Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we extend FCT by a...
Risk-Free Bidding in Complement-Free Combinatorial Auctions
We study risk-free bidding strategies in combinatorial auctions with incomplete information. Specifically, what is the maximum profit that a complement-free (subadditive) bidder can guarantee in a multi-item combinatorial auction? Suppose there are $...
Bayesian Optimization-based Combinatorial Assignment
We study the combinatorial assignment domain, which includes combinatorial auctions and course allocation. The main challenge in this domain is that the bundle space grows exponentially in the number of items. To address this, several papers have rec...
SAINT: Attention-Based Policies for Discrete Combinatorial Action Spaces
The combinatorial structure of many real-world action spaces leads to exponential growth in the number of possible actions, limiting the effectiveness of conventional reinforcement learning algorithms. Recent approaches for combinatorial action space...
AArnott/Xunit.Combinatorial
Adds combinatorial and pairwise testing capability to Xunit tests (⭐ 202)
Combinatorial principles - Wikipedia
In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used. The rule of sum, rule
Combinatorial representations
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any...
Combinatoriality - Wikipedia
In music using the twelve tone technique, combinatoriality is a quality shared by twelve-tone tone rows whereby each section of a row and a proportionate
pemami4911/neural-combinatorial-rl-pytorch
PyTorch implementation of Neural Combinatorial Optimization with Reinforcement Learning https://arxiv.org/abs/1611.09940 (⭐ 601)
Combinatorial design - Wikipedia
Combinatorial design theory is the part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets
Questions tagged [combinatorial-proofs] - Mathematics Stack Exchange
Combinatorial proofs of identities use double counting and combinatorial characterizations of binomial coefficients, powers, factorials etc. They avoid complicated algebraic manipulations.
Combinatorial Dyson-Schwinger equations and inductive data types
The goal of this contribution is to explain the analogy between combinatorial Dyson-Schwinger equations and inductive data types to a readership of mathematical physicists. The connection relies on an interpretation of combinatorial Dyson-Schwinger e...
Modern graph neural networks do worse than classical greedy algorithms in solving combinat…
The recent work ``Combinatorial Optimization with Physics-Inspired Graph Neural Networks'' [Nat Mach Intell 4 (2022) 367] introduces a physics-inspired unsupervised Graph Neural Network (GNN) to solve combinatorial optimization problems on sparse gra...
On Erasure Combinatorial Batch Codes
Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are $n$ items and $m$ servers, each of which stores a subset of the...
A combinatorial proof of a partition identity of Andrews and Stanley
In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof....
A note on Combinatorial Invariance of Kazhdan--Lusztig polynomials
We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the symmetric gro...