Search results for "MathematicsofComputing_GENERAL"
showing 10 items of 84 documents
Computer code from Sex roles and the evolution of parental care specialization
2019
Computer code for the mathematical model in Mathematica
Computer code from Sex roles and the evolution of parental care specialization.
2019
Computer code for the mathematical model in Mathematica
Daugavet- and delta-points in Banach spaces with unconditional bases
2020
We study the existence of Daugavet- and delta-points in the unit sphere of Banach spaces with a 1 1 -unconditional basis. A norm one element x x in a Banach space is a Daugavet-point (resp. delta-point) if every element in the unit ball (resp. x x itself) is in the closed convex hull of unit ball elements that are almost at distance 2 2 from x x . A Banach space has the Daugavet property (resp. diametral local diameter two property) if and only if every norm one element is a Daugavet-point (resp. delta-point). It is well-known that a Banach space with the Daugavet property does not have an unconditional basis. Similarly spaces with the diametral local diameter two property do not have an un…
Finite 2-groups with odd number of conjugacy classes
2016
In this paper we consider finite 2-groups with odd number of real conjugacy classes. On one hand we show that if $k$ is an odd natural number less than 24, then there are only finitely many finite 2-groups with exactly $k$ real conjugacy classes. On the other hand we construct infinitely many finite 2-groups with exactly 25 real conjugacy classes. Both resuls are proven using pro-$p$ techniques and, in particular, we use the Kneser classification of semi-simple $p$-adic algebraic groups.
Approximate convex hull of affine iterated function system attractors
2012
International audience; In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In additio…
Polynomial growth of the codimensions: a characterization
2009
Let A A be a not necessarily associative algebra over a field of characteristic zero. Here we characterize the T-ideal of identities of A A in case the corresponding sequence of codimensions is polynomially bounded.
Special Section on Quality Control by Artificial Vision
2008
This PDF file contains the editorial “Editorial: Special Section on Quality Control by Artificial Vision” for JEI Vol. 17 Issue 03
Fusion in the character table
1998
Suppose that P P is a Sylow p p -subgroup of a finite p p -solvable group G G . If g ∈ P g \in P , then the number of G G -conjugates of g g in P P can be read off from the character table of G G .
Mathematics and Non-School Gameplay
2015
This chapter investigates the mathematics in the gameplay of three popular games (Angry Birds, Plants vs. Zombies and The Sims) that are unlikely to be played in mathematics lessons. The three games are different but each has been observed to provide opportunity for mathematical activity in gameplay. After describing each game, and the mathematics that can arise in gameplay, the chapter explores two questions: What kind of mathematics is afforded in these games? Can these games be used in/for school mathematics? Issues considered under the first question include: the nature of mathematics and the difficulty of isolating the mathematics in non-school gameplay; players’ strategic actions as m…
THE SHAPLEY-SOLIDARITY VALUE FOR GAMES WITH A COALITION STRUCTURE
2013
A value for games with a coalition structure is introduced, where the rules guiding cooperation among the members of the same coalition are different from the interaction rules among coalitions. In particular, players inside a coalition exhibit a greater degree of solidarity than they are willing to use with players outside their coalition. The Shapley value is therefore used to compute the aggregate payoffs for the coalitions, and the solidarity value to obtain the payoffs for the players inside each coalition.