Results 11 to 20 of about 169,932 (295)
INTEGRABLE COMBINATORICS [PDF]
Proceedings of the International Congress of Mathematicians (ICM 2018), 2013 We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)
Di Francesco, Philippe
openaire +5 more sources
More on the Rainbow Disconnection in Graphs
Discussiones Mathematicae Graph Theory, 2022 Let G be a nontrivial edge-colored connected graph. An edge-cut R of G is called a rainbow-cut if no two of its edges are colored the same. An edge-colored graph G is rainbow disconnected if for every two vertices u and v of G, there exists a u-v-rainbow-
Bai Xuqing +3 more
doaj +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
Oriented diameter and rainbow connection number of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Xiaolong Huang +3 more
doaj +1 more source
Topics in Cognitive Science, EarlyView., 2023 Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley +1 more source
Borel combinatorics of locally finite graphs [PDF]
BCC, 2020 We provide a gentle introduction, aimed at non-experts, to Borel combinatorics that studies definable graphs on topological spaces. This is an emerging field on the borderline between combinatorics and descriptive set theory with deep connections to many
O. Pikhurko
semanticscholar +1 more source
A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
Journal of Mathematical Cryptology, 2020 We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David +3 more
doaj +1 more source
Polynomial reconstruction of the matching polynomial
Electronic Journal of Graph Theory and Applications, 2015 The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex ...
Xueliang Li, Yongtang Shi, Martin Trinks
doaj +1 more source
Advances in Applied Mathematics, 2008 We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
Blandín, Héctor, Díaz, Rafael
openaire +2 more sources
Topological Classification of Crystalline Insulators through Band Structure Combinatorics [PDF]
, 2016 We present a method for efficiently enumerating all allowed, topologically distinct, electronic band structures within a given crystal structure in all physically relevant dimensions. The algorithm applies to crystals without time-reversal, particle-hole,
J. Kruthoff +4 more
semanticscholar +1 more source