Search results for "Graph theory"

Nanomagnetic Self-Organizing Logic Gates

2021

The end of Moore's law for CMOS technology has prompted the search for low-power computing alternatives, resulting in several promising proposals based on magnetic logic[1-8]. One approach aims at tailoring arrays of nanomagnetic islands in which the magnetostatic interactions constrain the equilibrium orientation of the magnetization to embed logical functionalities[9-12]. Despite the realization of several proofs of concepts of such nanomagnetic logic[13-15], it is still unclear what the advantages are compared to the widespread CMOS designs, due to their need for clocking[16, 17] and/or thermal annealing [18,19] for which fast convergence to the ground state is not guaranteed. In fact, i…

The expressive power of the shuffle product

2010

International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…

Missing the Forest for the Trees: Why Cognitive Science Circa 2019 Is Alive and Well

2019

International audience; Núñez and colleagues (2019) chronicle in extraordinary detail the "demise" of cognitive science, as it was first defined in the late 1970s. The problem is that their account, however accurate, misses the forest for the trees. Cognitive science circa 2019 is alive and well; it just has not followed the path anticipated by its founders over 40 years ago.

Multiplicative loops of 2-dimensional topological quasifields

2015

We determine the algebraic structure of the multiplicative loops for locally compact $2$-dimensional topological connected quasifields. In particular, our attention turns to multiplicative loops which have either a normal subloop of positive dimension or which contain a $1$-dimensional compact subgroup. In the last section we determine explicitly the quasifields which coordinatize locally compact translation planes of dimension $4$ admitting an at least $7$-dimensional Lie group as collineation group.

Induction and Character Correspondences in Groups of Odd Order

2002

Abstract Let P be a Sylow p -subgroup of G . By Irr p ′ ( G ), we denote the set of irreducible characters of G which have degree not divisible by p . When G is a solvable group of odd order, M. Isaacs constructed a natural one-to-one correspondence *:Irr p ′ ( G ) → Irr p ′ ( N G ( P )) which depends only on G and P . In this paper, we show that if ξ G  = χ ∈ Irr p ′ ( G ), then (ξ*) N G ( P )  = χ*.

Characters of p′-Degree of p-Solvable Groups

2001

On p-Brauer characters of p′-degree and self-normalizing Sylow p-subgroups

2010

ZEROS OF CHARACTERS ON PRIME ORDER ELEMENTS

2001

Suppose that G is a finite group, let χ be a faithful irreducible character of degree a power of p and let P be a Sylow p-subgroup of G. If χ(x) ≠ 0 for all elements of G of order p, then P is cyclic or generalized quaternion. * The research of the first author is supported by a grant of the Basque Government and by the University of the Basque Country UPV 127.310-EB160/98. † The second author is supported by DGICYT.

Deuring’s mass formula of a Mumford family

2015

We study the Newton polygon jumping locus of a Mumford family in char p p . Our main result says that, under a mild assumption on p p , the jumping locus consists of only supersingular points and its cardinality is equal to ( p r − 1 ) ( g − 1 ) (p^r-1)(g-1) , where r r is the degree of the defining field of the base curve of a Mumford family in char p p and g g is the genus of the curve. The underlying technique is the p p -adic Hodge theory.

VARIATIONS ON THOMPSON'S CHARACTER DEGREE THEOREM

2001

If P is a Sylow- p -subgroup of a finite p -solvable group G , we prove that G^\prime \cap \bf{N}_G(P) \subseteq {P} if and only if p divides the degree of every irreducible non-linear p -Brauer character of G. More generally if π is a set of primes containing p and G is π-separable, we give necessary and sufficient group theoretic conditions for the degree of every irreducible non-linear p -Brauer character to be divisible by some prime in π. This can also be applied to degrees of ordinary characters.