Results 1 to 10 of about 3,119 (146)
Isomorphic factorization of r-regular graphs into r parts
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M N Ellingham
exaly +2 more sources
Note on the Hilbert 2-class field tower [PDF]
Let $k$ be a number field with a 2-class group isomorphic to the Klein four-group. The aim of this paper is to give a characterization of capitulation types using group properties.
Abdelmalek Azizi +2 more
doaj +1 more source
Universal third parts of any complete 2-graph and none of DK_{5} [PDF]
It is shown that there is no digraph \(F\) which could decompose the complete digraph on 5 vertices minus any 2-arc remainder into three parts isomorphic to \(F\) for each choice of the remainder.
Artur Fortuna, Zdzisław Skupień
doaj +1 more source
When using a discrete Fourier transform (DFT) to solve digital signal processing (DSP) problems, errors occur in rounding or truncating the results of operations to the word length used by specialized processors (SP).
M. I. Kalmykov +3 more
doaj +1 more source
The secure judgment of graphic similarity against malicious adversaries and its applications
With the advent of the era of big data, privacy computing analyzes and calculates data on the premise of protecting data privacy, to achieve data ‘available and invisible’.
Xin Liu +5 more
doaj +1 more source
La modalité hypothétique: évidences slavo’romanes et balkaniques (le cas du bulgare et du roumain)
This study describes the grammatical means of expressing conditional modality in Bulgarian and Romanian based on verbal categories with shared meanings and functions.
Petya Assenova
doaj +1 more source
The Hole Argument and Beyond: Part II: Treating Non-isomorphic Spacetimes
Abstract In this two-part paper we review, and then develop, the assessment of the hole argument for general relativity. The review (in Part I) discussed how to compare points in isomorphic spacetimes, i.e. models of the theory. This second Part proposes a framework for making comparisons of non-isomorphic spacetimes.
Gomes, Henrique, Butterfield, Jeremy
openaire +4 more sources
Montgomery Reduction for Gaussian Integers
Modular arithmetic over integers is required for many cryptography systems. Montgomery reduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Montgomery reduction is used for rings of ordinary integers.
Malek Safieh, Jürgen Freudenberger
doaj +1 more source
Student representational competence and self-assessment when solving physics problems
Student success in solving physics problems is related to the representational format of the problem. We study student representational competence in two large-lecture algebra-based introductory university physics courses with approximately 600 ...
Patrick B. Kohl, Noah D. Finkelstein
doaj +2 more sources
Finite Vertex Bi-Primitive 2-Arc Transitive Graphs Admitting a Two-Dimensional Linear Group
A graph is said to be vertex bi-primitive, if it is a bipartite graph, and the setwise stabilizer of its automorphism group acts primitively on two bi-parts.
Xiaohui Hua
doaj +1 more source

