Combinatorics and physics - Wikipedia
Combinatorial physics or physical combinatorics is the area of interaction between physics and combinatorics. "Combinatorial Physics is an emerging area
Hardness of Online Sleeping Combinatorial Optimization Problems
We show that several online combinatorial optimization problems that admit efficient no-regret algorithms become computationally hard in the sleeping setting where a subset of actions becomes unavailable in each round. Specifically, we show that the...
Cookie Monster Plays Games
We research a combinatorial game based on the Cookie Monster problem called the Cookie Monster game that generalizes the games of Nim and Wythoff. We also propose several combinatorial games that are in between the Cookie Monster game and Nim. We dis...
Non-detectable patterns hidden within sequences of bits
In this paper we construct families of bit sequences using combinatorial methods. Each sequence is derived by con- verting a collection of numbers encoding certain combinatorial nu- merics from objects exhibiting symmetry in various dimensions. Using...
Combinatorial Identities for Generalized Stirling Numbers Expanding $f$-Factorial Function…
We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the corresponding ge...
Online Combinatorial Allocation with Interdependent Values
We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each agent possesses a private signal that captures her information about an...
Set-Valued Skyline Fillings
Set-valued tableaux play an important role in combinatorial $K$-theory. Separately, semistandard skyline fillings are a combinatorial model for Demazure atoms and key polynomials. We unify these two concepts by defining a set-valued extension of semi...
Universally Sacks-indestructible combinatorial families of reals
We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other similar types of...
Combinatorial Optimization in OR?
Hi, I got a Phd in Computer Science. I am interested in combinatorial optimization, so I am thinking of starting a postdoc in RO to work on this topic. What makes me doubt is that if I look for com...
Combinatorial explosion - Wikipedia
In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to the way its combinatorics depends on input, constraints
Combinatorial game theory - Wikipedia
Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information
Combinatorial Hopf algebras
We define a "combinatorial Hopf algebra" as a Hopf algebra which is free (or cofree) and equipped with a given isomorphism to the free algebra over the indecomposables (resp. the cofree coalgebra over the primitives). The choice of such an isomorph...
Combinatorial interpretation of Binomial Inversion
In discrete calculus it's the poset $\mathbb {Z}_ {\ge 0}$ under the usual order. This beautiful theory was first described by Gian-Carlo Rota in On the Foundations of Combinatorial Theory I, and elaborated …
Combinatorial data analysis - Wikipedia
In statistics, combinatorial data analysis (CDA) is the study of data sets where the order in which objects are arranged is important. CDA can be used
Newest 'combinatorial-game-theory' Questions - Mathematics Stack …
Combinatorial game theory (abbreviated CGT) is the subfield of combinatorics (not traditional game theory) which deals with games of perfect information such as Nim and Go. It includes topics such as …
Combinatorial topology - Wikipedia
In mathematics, combinatorial topology was an older name for algebraic topology, dating from the time when topological invariants of spaces (for example
Combinatorial proof of $\sum_ {k=1}^n k k!= (n+1)!-1$
Jul 22, 2016 · Moreover, a simple combinatorial [fixed point or not fixed point]-argument (see next section) can be used to alternatively confirm $\text { (1)}$ by counting permutations,
Combinatorial proofs of q-series identities
We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419]....
Why algebraic topology is also called combinatorial topology?
Combinatorial topology is the older name for algebraic topology when all topological problems were expressed, set up and solved in Euclidean space of dimensions 1,2 and 3.
Combinatorial proof of summation of $\\sum\\limits_{k = 0}^n {n ...
May 23, 2012 · Just FYI, what you call a "logical proof" is known as a "combinatorial proof", and such a proof is perfectly valid and often very insightful. What I suspect you mean by "mathematical proof" is …