Results 71 to 80 of about 245,402 (215)
Structure and Combinatorics on Right Groups
Right groups form an important bridge between group theory and semigroup theory, combining the algebraic symmetry of groups with the one-sided structure of right zero semigroups.
Aftab Hussain Shah +2 more
doaj +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
Bounded diameter monochromatic component covers
Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
How to pick your football team
Abstract Team captains Alice and Bob divide up 2m$2m$ footballers, each reduced to a real‐valued score, into two teams of m$m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer.
Bhargav Narayanan
wiley +1 more source
SMARANDACHE MULTI-SPACE THEORY, Second Edition [PDF]
We are used to the idea that our space has three dimensions: length, breadth and height with time providing the fourth dimension of spacetime by Einstein. In the string or superstring theories, we encounter 10 dimensions.
MAO, Linfan
core +1 more source
An effective Bombieri–Vinogradov error term for sifting problems
Abstract In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for which they hold cannot be computed.
Daniel R. Johnston
wiley +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Algebraic curves and topological sequences play a crucial role in mathematics and graph theory, serving as a bridge between geometry, algebra, and number theory.
Mohammad Mazyad Hazzazi +4 more
doaj +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

