Results 11 to 20 of about 268,026 (223)

The inclusion and exclusion principle in view of number theory

Ratio Mathematica, 2019
The inclusion and exclusion (connection and disconnection) principle is mainly known from combinatorics in solving the combinatorial problem of calculating all permutations of a finite set or other combinatorial problems.
Viliam Ďuriš, Tomáš Lengyelfalusy
doaj   +1 more source

Network conduciveness with application to the graph-coloring and independent-set optimization transitions. [PDF]

PLoS ONE, 2010
BACKGROUND: Given an undirected graph, we consider the two problems of combinatorial optimization, which ask that its chromatic and independence numbers be found.
Valmir C Barbosa
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

Viruses, 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, Roman Jaksik, Pawel Kuś, Marek Kimmel   +3 more
doaj   +1 more source

The Structure of n-Point One-Loop Open Superstring Amplitudes [PDF]

, 2014
In this article we present the worldsheet integrand for one-loop amplitudes in maximally supersymmetric superstring theory involving any number n of massless open string states.
A Bilal, A Tsuchiya, AB Goncharov, BEW Nilsson, Carlos R. Mafra, CR Mafra, CR Mafra, CR Mafra, CR Mafra, CR Mafra, CR Mafra, CR Mafra, CR Mafra, CR Mafra, D Lüst, E D’Hoker, E D’Hoker, E D’Hoker, E Witten, EP Verlinde, FA Berends, G Policastro, H Gomez, H Gomez, I Oda, J Bjornsson, J Bjornsson, JJ Atick, JJ Carrasco, JM Drummond, JM Drummond, JP Harnad, L Brink, LA Barreiro, LJ Dixon, M Tentyukov, MAA Leeuwen van, MB Green, MB Green, MB Green, MB Green, MB Green, MB Green, N Arkani-Hamed, N Arkani-Hamed, N Arkani-Hamed, N Berkovits, N Berkovits, N Berkovits, N Berkovits, N Berkovits, N Berkovits, N Berkovits, N Berkovits, N Berkovits, NEJ Bjerrum-Bohr, NEJ Bjerrum-Bohr, Oliver Schlotterer, PA Grassi, R Kleiss, RH Boels, RM Schabinger, S Caron-Huot, S Stieberger, S Stieberger, S Stieberger, SJ Parke, T Ritbergen van, V Duca Del, Y Aisaka, Z Bern, Z Bern, Z Bern, Z Bern, Z Bern, Z Bern, Z Bern, Z Bern, Z Bern   +78 more
core   +2 more sources

Congruence schemes [PDF]

, 2016
A new category of algebro-geometric objects is defined. This construction is a vast generalization of existing F1-theories, as it contains the the theory of monoid schemes on the one hand and classical algebraic theory, e.g.
ANTON DEITMAR, Deitmar A., Haran M. J. S., Kurokawa N., Soulé C.   +4 more
core   +1 more source

Tops as building blocks for G 2 manifolds

Journal of High Energy Physics, 2017
A large number of examples of compact G 2 manifolds, relevant to supersymmetric compactifications of M-Theory to four dimensions, can be constructed by forming a twisted connected sum of two building blocks times a circle.
Andreas P. Braun
doaj   +1 more source

The biHecke monoid of a finite Coxeter group and its representations [PDF]

, 2012
For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W.
Albert, Anne Schilling, Benson, Curtis, Denton, Denton, Florent Hivert, Humphreys, Le Conte de Poly-Barbut, Manivel, Nicolas Thiéry, Serre, Stanley, Thiéry, Zelevinsky   +14 more
core   +3 more sources

Finite Embeddability of Sets and Ultrafilters [PDF]

, 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

The coefficients of transitivity of the posets of MM-type being the highest supercritical poset

Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2022
The representations of partially ordered sets (abbreviated as posets), introduced by L. A. Nazarova and A. V. Roiter (in matrix form) in 1972, play an important role in the modern representation theory. In his first paper on this topic M. M.
В. М. Бондаренко, М. В. Стойка, М. В. Стьопочкіна   +2 more
doaj   +1 more source

Spanning forests and the vector bundle Laplacian [PDF]

, 2011
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial interpretation
Kenyon, Richard
core   +1 more source