The reversible pebble game is a combinatorial game played on rooted DAGs. This game was introduced by Bennett (1989) motivated by applications in designing space efficient reversible algorithms. Recently, Chan (2013) showed that the reversible pebble...
The notion of a reduced expression for a double coset in a Coxeter group was introduced by Williamson, and recent work of Elias and Ko has made this theory more accessible and combinatorial. One result of Elias-Ko is that any coset admits a reduced e...
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...
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...
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...
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 …
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...
In combinatorial game theory, the Sprague–Grundy theorem states that every impartial game under the normal play convention is equivalent to a one-heap
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....
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...
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...
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...
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...
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...
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...
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...
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...
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)...
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 …
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...