Results 31 to 40 of about 6,070 (257)
On Irreducible Maps and Slices [PDF]
Combinatorics, Probability and Computing, 2014 We consider the problem of enumeratingd-irreducible maps,i.e., planar maps all of whose cycles have length at leastd, and such that any cycle of lengthdis the boundary of a face of degreed. We develop two approaches in parallel: the natural approach via substitution, where these maps are obtained from general maps by a replacement of alld-cycles by ...
Bouttier, Jérémie, Guitter, Emmanuel
openaire +5 more sources
Rough representations of rough topological groups
Applied General Topology, 2023 In this paper, the concept of rough representation of a rough topological group on a Banach space is explored. Mainly, the continuity and the irreducibility of rough representations are studied.
Essoyomewè Kieou +2 more
doaj +1 more source
Enumeration of irreducible and extended irreducible Goppa codes
CoRR, 2019 We obtain upper bounds on the number of irreducible and extended irreducible Goppa codes over $GF(p)$ of length $q$ and $q+1$, respectively defined by polynomials of degree $r$, where $q=p^t$ and $r\geq 3$ is a positive integer.
Kondwani Magamba, John A. Ryan
openaire +3 more sources
Irreducibility testing and factorization of polynomials
, 1983 It is shown that under certain hypotheses, irreducibility testing and factorization of polynomials with integer coefficients are polynomial time reducible to primality testing and factorization of integers, respectively. Combined with recently discovered
Andrew M. Odlyzko, Leonard M. Adleman
core +1 more source
On permutation polynomials over finite fields
International Journal of Mathematics and Mathematical Sciences, 1987 A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a ...
R. A. Mollin, C. Small
doaj +1 more source
On the Relationship between Cognitive and Sensory Phenomenology
Phenomenology and Mind, 2017 My main aim in this paper is to consider what methodology is best suited to adopt for one who believes that there is cognitive phenomenology (CP) in order to argue for its irreducibility to sensory phenomenology.
Elisabetta Sacchi
doaj +1 more source
IRREDUCIBLE COXETER GROUPS [PDF]
International Journal of Algebra and Computation, 2007 We prove that a non-spherical irreducible Coxeter group is (directly) indecomposable and that an indefinite irreducible Coxeter group is strongly indecomposable in the sense that all its finite index subgroups are (directly) indecomposable. Let W be a Coxeter group.
openaire +3 more sources
Effective Noether Irreducibility Forms and Applications [PDF]
, 1995 Using recent absolute irreducibility testing algorithms, we derive new irreducibility forms. These are integer polynomials in variables which are the generic coefficients of a multivariate polynomial of a given degree.
Kaltofen, E.
core +1 more source
Consciousness and Cognition. The Cognitive Phenomenology Debate
Phenomenology and Mind, 2017 According to a position which has dominated the theoretical landscape in the philosophy of mind until recently, only sensory states exhibit a characteristic phenomenal dimension, whereas cognitive states either utterly lack it, or inherit it from some of
Elisabetta Sacchi, Alberto Voltolini
doaj +1 more source