Results 61 to 70 of about 55,778 (257)
A Formal Account of Structuring Motor Actions With Sensory Prediction for a Naive Agent
Frontiers in Robotics and AI, 2020 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
Algebraic properties of word equations
, 2014 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
Max-algebra: the linear algebra of combinatorics?
Linear Algebra and its Applications, 2003 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
Degrees and prime power order zeros of characters of symmetric and alternating groups
Bulletin of the London Mathematical Society, EarlyView.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
Growth problems in diagram categories
Bulletin of the London Mathematical Society, EarlyView.Abstract In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Jonathan Gruber, Daniel Tubbenhauer
wiley +1 more source
ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE
Forum of Mathematics, Sigma, 2016 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
Centrality of star and monotone factorisations
Bulletin of the London Mathematical Society, EarlyView.Abstract A factorisation problem in the symmetric group is central if conjugate permutations always have the same number of factorisations. We give the first fully combinatorial proof of the centrality of transitive star factorisations that is valid in all genera, which answers a natural question of Goulden and Jackson from 2009.
Jesse Campion Loth, Amarpreet Rattan
wiley +1 more source
Multiplication and combinatorics in the Steenrod algebra
Journal of Pure and Applied Algebra, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the combinatorics of commutators of Lie algebras [PDF]
Journal of Algebra and Its Applications, 2019 Motivated by the combinatorial properties of products in Lie algebras, we investigate the subset of permutations that naturally appears when we write the long commutator [Formula: see text] as a sum of associative monomials. We characterize this subset and find some useful equivalences.
Eduardo Eizo Aramaki Hitomi +1 more
openaire +3 more sources
7‐Location, weak systolicity, and isoperimetry
Transactions of the London Mathematical Society, Volume 12, Issue 1, December 2025.Abstract m$m$‐Location is a local combinatorial condition for flag simplicial complexes introduced by Osajda. Osajda showed that simply connected 8‐located locally 5‐large complexes are hyperbolic. We treat the nonpositive curvature case of 7‐located locally 5‐large complexes.
Nima Hoda, Ioana‐Claudia Lazăr
wiley +1 more source