518 results for combinatorial

arxiv.org/abs/2505.01803v1

Switched Systems Control via Discreteness-Promoting Regularization

This paper proposes a novel method for designing finite-horizon discrete-valued switching signals in linear switched systems based on discreteness-promoting regularization. The inherent combinatorial optimization problem is reformulated as a continuo...

arxiv.org/abs/2308.06123v1

PED and POD partitions: combinatorial proofs of recurrence relations

PED partitions are partitions with even parts distinct while odd parts are unrestricted. Similarly, POD partitions have distinct odd parts while even parts are unrestricted. Merca proved several recurrence relations analytically for the number of PED...

www.bing.com/ck/a?!&&p=458144dc5b797d56da66f55964b9e05437629e1ec28ff8cadd630a36ea3417a0JmltdHM9MTc3Mjc1NTIwMA&ptn=3&ver=2&hsh=4&fclid=063856f3-0392-6eaf-3bd6-41e602b56f16&u=a1aHR0cHM6Ly9qbXRvbWN6YWsuZ2l0aHViLmlvL3BkZi9jdl9KYWt1Yl9Ub21jemFrLnBkZg&ntb=1

Jakub M. Tomczak

J.M. Tomczak, ”Deep Generative Modeling”, Springer, Cham, 2022 (The first comprehensive book on Generative AI) CY. Oh, J.M. Tomczak, E. Gavves, M. Welling, Combinatorial Bayesian Optimization …

en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem

Sprague–Grundy theorem - Wikipedia

In combinatorial game theory, the Sprague–Grundy theorem states that every impartial game under the normal play convention is equivalent to a one-heap

arxiv.org/abs/2602.12372v1

Enumerative combinatorics package for CoCoA

We introduce the package combinatorics for the software CoCoA. This package provides a data structure and the necessary methods for computing several known enumerative combinatorial invariants....

arxiv.org/abs/1312.5408v3

Diversities and the Geometry of Hypergraphs

The embedding of finite metrics in $\ell_1$ has become a fundamental tool for both combinatorial optimization and large-scale data analysis. One important application is to network flow problems in which there is close relation between max-flow min-c...

arxiv.org/abs/2602.21859v1

Steiner Forest for $H$-Subgraph-Free Graphs

Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and combinatorial...

arxiv.org/abs/math/9904184v1

Mean-field lattice trees

We introduce a mean-field model of lattice trees based on embeddings into $\Z^d$ of abstract trees having a critical Poisson offspring distribution. This model provides a combinatorial interpretation for the self-consistent mean-field model introdu...

arxiv.org/abs/2304.07612v2

A Cheeger Inequality for Small Set Expansion

The discrete Cheeger inequality, due to Alon and Milman (J. Comb. Theory Series B 1985), is an indispensable tool for converting the combinatorial condition of graph expansion to an algebraic condition on the eigenvalues of the graph adjacency matrix...

www.bing.com/ck/a?!&&p=068fe897fa20df97dad7ab73d52525d3a16ebaa952496eb0cd851da4e7b39ee1JmltdHM9MTc3Mjc1NTIwMA&ptn=3&ver=2&hsh=4&fclid=3bedf6bd-ecf9-62d7-0140-e1a8ed8b6357&u=a1aHR0cHM6Ly9qbXRvbWN6YWsuZ2l0aHViLmlvL3BkZi9jdl9KYWt1Yl9Ub21jemFrLnBkZg&ntb=1

Jakub M. Tomczak

J.M. Tomczak, ”Deep Generative Modeling”, Springer, Cham, 2022 (The first comprehensive book on Generative AI) CY. Oh, J.M. Tomczak, E. Gavves, M. Welling, Combinatorial Bayesian Optimization …

arxiv.org/abs/1406.6859v1

Combinatorial Voter Control in Elections

Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters are added...

arxiv.org/abs/2505.06414v1

Battle Sheep is PSPACE-complete

Battle Sheep is a board game published by Blue Orange Games. With two players, it is a combinatorial game that uses normal play rules. We show that it is PSPACE-complete, even when each stack has only up to 3 tokens....