Results 61 to 70 of about 56,264 (249)
The Role of Dice in the Emergence of the Probability Calculus
Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source
Triangular arrangements on the projective plane [PDF]
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a Roots-of-Unity-Arrangement ...
Simone Marchesi, Jean Vallès
doaj
Max-algebra: the linear algebra of combinatorics?
The paper deals with the relationship between basic max-algebraic problems and combinatorial or combinatorial optimization problems. By max-algebra the author understands the analogue of linear algebra developed for the pair of operations \((\oplus, \otimes)\) extended to matrices and vectors formally in the same way as in linear algebra.
openaire +3 more sources
Existence and orthogonality of stable envelopes for bow varieties
Abstract Stable envelopes, introduced by Maulik and Okounkov, provide a family of bases for the equivariant cohomology of symplectic resolutions. They are part of a fascinating interplay between geometry, combinatorics and integrable systems. In this expository article, we give a self‐contained introduction to cohomological stable envelopes of type A$A$
Catharina Stroppel, Till Wehrhan
wiley +1 more source
Algebraic properties of word equations
The question about maximal size of independent system of word equations is one of the most striking problems in combinatorics on words. Recently, Aleksi Saarela has introduced a new approach to the problem that is based on linear-algebraic properties of ...
Holub, Štěpán, Žemlička, Jan
core +1 more source
Indiscernibles in monadically NIP theories
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley +1 more source
ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE
For each integer $d\geqslant 3$ , we obtain a characterization of all graphs in which the ball of radius
ITAI BENJAMINI, DAVID ELLIS
doaj +1 more source
A Formal Account of Structuring Motor Actions With Sensory Prediction for a Naive Agent
For naive robots to become truly autonomous, they need a means of developing their perceptive capabilities instead of relying on hand crafted models.
Jean-Merwan Godon +2 more
doaj +1 more source
Degrees and prime power order zeros of characters of symmetric and alternating groups
Abstract We show that the p$p$‐part of the degree of an irreducible character of a symmetric group is completely determined by the set of vanishing elements of p$p$‐power order. As a corollary, we deduce that the set of zeros of prime power order controls the degree of such a character. The same problem is analysed for alternating groups, where we show
Eugenio Giannelli +2 more
wiley +1 more source
Multiplication and combinatorics in the Steenrod algebra
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

