Results 31 to 40 of about 410,090 (251)
Discrete Analysis, 2023 Limits of Latin squares, Discrete Analysis 2023:8, 66 pp. There has been a great deal of work over the last fifteen to twenty years on the theme of continuous limits of discrete combinatorial objects. In particular, any sequence of graphs of increasing
Frederik Garbe +3 more
doaj +1 more source
Combinatorial Optimization: Between Practice and Theory
Discrete Applied Mathematics, 2019 Suppose we have a set S of baseball teams and up to this point in the season, each team x ∈ S has won wx games. Through the remainder of the season every pair of teams x, y ∈ S must still play gxy games against each other.
A. Brodnik, S. Martello
semanticscholar +1 more source
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
Entropy, 2018 In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou +1 more
doaj +1 more source
Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols
Discrete Analysis, 2021 Larger corner-free sets from better NOF exactly-$N$ protocols, Discrete Analysis 2021:19, 9 pp. If $G$ is an Abelian group, then a _corner_ in $G^2$ is a subset of the form $\{(x,y),(x+d,y),(x,y+d)\}$ with $d\ne 0$.
Nati Linial, Adi Shraibman
doaj +1 more source
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT [PDF]
, 2015 Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F.
B Aspvall +12 more
core +3 more sources
Constraint Answer Set Programming without Grounding [PDF]
Theory and Practice of Logic Programming, 2018 Extending ASP with constraints (CASP) enhances its expressiveness and performance. This extension is not straightforward as the grounding phase, present in most ASP systems, removes variables and the links among them, and also causes a combinatorial ...
Joaquín Arias +4 more
semanticscholar +1 more source
Place-difference-value patterns: A generalization of generalized permutation and word patterns
, 2009 Motivated by study of Mahonian statistics, in 2000, Babson and Steingrimsson introduced the notion of a "generalized permutation pattern" (GP) which generalizes the concept of "classical" permutation pattern introduced by Knuth in 1969.
Kitaev, Sergey, Remmel, Jeffrey
core +3 more sources
Nonlocal, noncommutative diagrammatics and the linked cluster Theorems [PDF]
, 2011 Recent developments in quantum chemistry, perturbative quantum field theory, statistical physics or stochastic differential equations require the introduction of new families of Feynman-type diagrams. These new families arise in various ways.
Brouder, Christian, Frédéric, Patras
core +3 more sources
Recovering General Relativity from a Planck Scale Discrete Theory of Quantum Gravity
Philosophy of PhysicsAn argument is presented that if a theory of quantum gravity is physically discrete at the Planck scale and the theory recovers General Relativity as an approximation, then, at the current stage of our knowledge, causal sets must arise within the theory,
Jeremy Butterfield, Fay Dowker
doaj +1 more source
Products of Menger spaces: A combinatorial approach [PDF]
Annals of Pure and Applied Logic, 2016 We construct Menger subsets of the real line whose product is not Menger in the plane. In contrast to earlier constructions, our approach is purely combinatorial.
P. Szewczak, B. Tsaban
semanticscholar +1 more source