arxiv.org/abs/2505.01803v1
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/2102.08415v2
Power system N-x contingency analysis has inherent challenges due to its combinatorial characteristic where outages grow exponentially with the increase of x and N. To address these challenges, this paper proposes a method that utilizes Line Outage D...
arxiv.org/abs/2308.06123v1
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
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/2310.08230v2
In this work we propose to combine the advantages of learningbased and combinatorial formalisms for 3D shape matching. While learningbased methods lead to state-of-the-art matching performance, they do not ensure geometric consistency, so that obtain...
en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem
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
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
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/1312.5565v2
A proof is presented that gene regulatory networks (GRNs) based solely on transcription factors cannot control the development of complex multicellular life. GRNs alone cannot explain the evolution of multicellular life in the Cambrian Explosion. Net...
arxiv.org/abs/1508.03531v1
Gene Regulatory Networks (GRNs) consisting of combinations of transcription factors (TFs) and their cis promoters are assumed to be sufficient to direct the development of organisms. Mutations in GRNs are assumed to be the primary drivers for the evo...
arxiv.org/abs/2602.21859v1
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
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
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...
arxiv.org/abs/1706.03944v1
A major investment made by a telecom operator goes into the infrastructure and its maintenance, while business revenues are proportional to how big and good the customer base is. We present a data-driven analytic strategy based on combinatorial optim...
arxiv.org/abs/2211.16434v1
We provide a combinatorial characterisation of positive diagrams satisfying the equality in the Morton-Franks-Williams bound for the degrees of the HOMFLY-PT polynomial. This characterisation allows generating with relative ease examples of diagrams...
arxiv.org/abs/1912.06548v1
Many types of geospatial analyses are computationally complex, involving, for example, solution processes that require numerous iterations or combinatorial comparisons. This complexity has motivated the application of high performance computing (HPC)...
www.bing.com/ck/a?!&&p=068fe897fa20df97dad7ab73d52525d3a16ebaa952496eb0cd851da4e7b39ee1JmltdHM9MTc3Mjc1NTIwMA&ptn=3&ver=2&hsh=4&fclid=3bedf6bd-ecf9-62d7-0140-e1a8ed8b6357&u=a1aHR0cHM6Ly9qbXRvbWN6YWsuZ2l0aHViLmlvL3BkZi9jdl9KYWt1Yl9Ub21jemFrLnBkZg&ntb=1
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
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/quant-ph/0605148v1
In this paper we explore further the connections between convex bodies related to quantum correlation experiments with dichotomic variables and related bodies studied in combinatorial optimization, especially cut polyhedra. Such a relationship was...
arxiv.org/abs/2505.06414v1
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....