Results 1 to 10 of about 400,157 (250)
Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle? [PDF]
International Conference on Intelligent Computer Mathematics, 2014 When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin’s 2004 survey article on Auction Theory using the Isabelle/HOL system, and we ...
M. Caminati +3 more
semanticscholar +5 more sources
Group field theories for all loop quantum gravity
New Journal of Physics, 2015 Group field theories represent a second quantized reformulation of the loop quantum gravity state space and a completion of the spin foam formalism. States of the canonical theory, in the traditional continuum setting, have support on graphs of arbitrary
Daniele Oriti +2 more
doaj +2 more sources
Postulates of the cognitive theory of thinking and their consequences [PDF]
Известия высших учебных заведений: Прикладная нелинейная динамика, 2022 Purpose of the work is to create a theoretical model of the thinking process, considered as a set of operations for the formation of cognitive generalizations of the level of categories (concepts).
Antonets, Vladimir Aleksandrovich
doaj +1 more source
Qualitative motivation with sets and relations
Frontiers in Psychology, 2023 In self-determination theory (SDT), multiple conceptual regulations of motivation are posited. These forms of motivation are especially qualitatively viewed by SDT researchers, and there are situations in which combinations of these regulations occur. In
Ali Ünlü
doaj +1 more source
Seaweeds Arising from Brauer Configuration Algebras
Mathematics, 2023 Seaweeds or seaweed Lie algebras are subalgebras of the full-matrix algebra Mat(n) introduced by Dergachev and Kirillov to give an example of algebras for which it is possible to compute the Dixmier index via combinatorial methods.
Agustín Moreno Cañadas +1 more
doaj +1 more source
The Discrete Fundamental Group of the Associahedron [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The associahedron is an object that has been well studied and has numerous applications, particularly in the theory of operads, the study of non-crossing partitions, lattice theory and more recently in the study of cluster algebras.
Christopher Severs, Jacob White
doaj +1 more source
Lattice paths with catastrophes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero.
Cyril Banderier, Michael Wallner
doaj +1 more source
Graph theory and combinatorial calculus: an early approach to enhance robust understanding
ZDM – Mathematics Education, 2022 The objective of this work is to show an educational path for combinatorics and graph theory that has the aim, on one hand, of helping students understand some discrete mathematics properties, and on the other, of developing modelling skills through a ...
Daniela Ferrarello +3 more
semanticscholar +1 more source
Optimal schemes for combinatorial query problems with integer feedback [PDF]
Combinatorial Theory, 2022 A query game is a pair of a set $Q$ of queries and a set $\mathcal{F}$ of functions, or codewords $f:Q\rightarrow \mathbb{Z}.$ We think of this as a two-player game. One player, Codemaker, picks a hidden codeword $f\in \mathcal{F}$.
A. Martinsson
semanticscholar +1 more source
The Journal of Engineering, 2023 Travelling salesman problem (TSP) is one of the most famous problems in graph theory, as well as one of the typical nondeterministic polynomial time (NP)‐hard problems in combinatorial optimization. Reinforcement learning (RL) has been widely regarded as
Jiaying Wang +3 more
doaj +1 more source