Results 11 to 20 of about 53,379 (231)

Dynamic Galois Theory

open access: yesJournal of Symbolic Computation, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diaz-Toca, G.M., Lombardi, H.
openaire   +2 more sources

The Galois group of a stable homotopy theory [PDF]

open access: yes, 2016
To a "stable homotopy theory" (a presentable, symmetric monoidal stable $\infty$-category), we naturally associate a category of finite \'etale algebra objects and, using Grothendieck's categorical machine, a profinite group that we call the Galois group.
Mathew, Akhil
core   +1 more source

SERRE WEIGHTS AND WILD RAMIFICATION IN TWO-DIMENSIONAL GALOIS REPRESENTATIONS

open access: yesForum of Mathematics, Sigma, 2016
A generalization of Serre’s Conjecture asserts that if $F$ is a totally real field, then certain characteristic
LASSINA DEMBÉLÉ   +2 more
doaj   +1 more source

Galois theory for semiclones [PDF]

open access: yes, 2015
We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained in the other. The Galois closed sets on both sides are characterised as locally closed subuniverses of the full iterative function ...
Behrisch, Mike
core   +4 more sources

Cyclic Homology and Quantum Orbits [PDF]

open access: yes, 2015
A natural isomorphism between the cyclic object computing the relative cyclic homology of a homogeneous quotient-coalgebra-Galois extension, and the cyclic object computing the cyclic homology of a Galois coalgebra with SAYD coefficients is presented ...
Maszczyk, Tomasz, Sütlü, Serkan
core   +1 more source

DIFFERENTIATION OF POLYNOMIALS IN SEVERAL VARIABLES OVER GALOIS FIELDS OF FUZZY CARDINALITY AND APPLICATIONS TO REED-MULLER CODES

open access: yesAdvanced Engineering Research, 2018
Introduction. Polynomials in several variables over Galois fields provide the basis for the Reed-Muller coding theory, and are also used  in a number of cryptographic problems.
V. M. Deundyak, N. S. Mogilevskaya
doaj   +1 more source

Four-Fold Formal Concept Analysis Based on Complete Idempotent Semifields

open access: yesMathematics, 2021
Formal Concept Analysis (FCA) is a well-known supervised boolean data-mining technique rooted in Lattice and Order Theory, that has several extensions to, e.g., fuzzy and idempotent semirings.
Francisco José Valverde-Albacete   +1 more
doaj   +1 more source

Counting stabiliser codes for arbitrary dimension [PDF]

open access: yesQuantum, 2023
In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross \cite{Gross2006} the number of $[[n,k]]_d$ stabilizer codes was computed for the case ...
Tanmay Singal   +5 more
doaj   +1 more source

Practice of the Incomplete $p$-Ramification Over a Number Field -- History of Abelian $p$-Ramification

open access: yesCommunications in Advanced Mathematical Sciences, 2019
The theory of $p$-ramification, regarding the Galois group of the maximal pro-$p$-extension of a number field $K$, unramified outside $p$ and $\infty$, is well known including numerical experiments with PARI/GP programs.
Georges Gras
doaj   +1 more source

A History of Selected Topics in Categorical Algebra I: From Galois Theory to Abstract Commutators and Internal Groupoids [PDF]

open access: yesCategories and General Algebraic Structures with Applications, 2016
This paper is a chronological survey, with no proofs, of a direction in categorical algebra, which is based on categorical Galois theory and involves generalized central extensions, commutators, and internal groupoids in Barr exact Mal’tsev and more ...
George Janelidze
doaj  

Home - About - Disclaimer - Privacy