Results 11 to 20 of about 410,090 (251)

Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle? [PDF]

open access: yesInternational 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 ...
C. Lange   +6 more
core   +4 more sources

Statistics of base polytopes in F-theory

open access: yesJournal of High Energy Physics
We propose a new statistical ensemble of toric bases for elliptic Calabi-Yaus used in F-theory models, by focusing on only the convex hull of the base, i.e., the base polytope.
Washington Taylor   +2 more
doaj   +2 more sources

Universally Sacks-indestructible combinatorial families of reals [PDF]

open access: yesAnnals of Pure and Applied Logic, 2023
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 ...
Vera Fischer, L. Schembecker
semanticscholar   +1 more source

Graph theory and combinatorial calculus: an early approach to enhance robust understanding

open access: yesZDM – 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]

open access: yesCombinatorial 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

Combining genetic algorithm with machine learning strategies for designing potent antimicrobial peptides

open access: yesBMC Bioinformatics, 2021
Background Current methods in machine learning provide approaches for solving challenging, multiple constraint design problems. While deep learning and related neural networking methods have state-of-the-art performance, their vulnerability in decision ...
Kyle Boone   +4 more
doaj   +1 more source

Genomic Analysis of SARS-CoV-2 Alpha, Beta and Delta Variants of Concern Uncovers Signatures of Neutral and Non-Neutral Evolution

open access: yesViruses, 2022
Due to the emergence of new variants of the SARS-CoV-2 coronavirus, the question of how the viral genomes evolved, leading to the formation of highly infectious strains, becomes particularly important. Three major emergent strains, Alpha, Beta and Delta,
Monika Klara Kurpas   +3 more
doaj   +1 more source

Optimum Vector Information Technologies Based on the Multidimensional Combinatorial Configurations

open access: yesInternational Journal of Computational and Applied Mathematics & Computer Science, 2023
Paper devoiced to optimum vector information technologies based on the multi-dimensional combinatorial configurations, such as Ideal Ring Bundles (IRBs). One-dimensional IRBs are ring ordered positive integers that form finite set of integers from 1 to S
V. Riznyk
semanticscholar   +1 more source

Multiple recurrence and large intersections for abelian group actions

open access: yesDiscrete Analysis, 2021
Multiple recurrence and large intersections for abelian group actions, Discrete Analysis 2021:18, 91 pp. In 1975, Szemerédi proved his famous theorem that asserts that for every positive integer $k$ and every $\delta>0$ there exists $n$ such that every ...
Ethan Ackelsberg   +2 more
doaj   +1 more source

Finite Embeddability of Sets and Ultrafilters [PDF]

open access: yes, 2015
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper we study it ...
Blass, Andreas, Di Nasso, Mauro
core   +3 more sources

Home - About - Disclaimer - Privacy