We show that for the primes l = 2, 3, 5, 7 or 13, there do not exist any non-zero abelian varieties over Q that have good reduction at every prime different from l and are semi-stable at l. We show that any semi-stable abelian variety over Q with good reduction outside l = 11 is isogenous to a power of the Jacobian variety of the modular curve X0(11). In addition we show that for l = 2, 3 and 5...

Pressure ulcer prevalence is frequently cited as a factor used to determine the quality of nursing care and is used as a proxy measure for nursing home quality. This paper reports the results of the organisational study conducted as a subcomponent of the PRIME trial. The PRIME trial was a multi-dimensional clinical trial designed to investigate the effectiveness of an integrated pressure ulcer ...

let r be a g-graded ring and m be a g-graded r-module. in this article, we introduce the concept of graded weakly classical prime submodules and give some properties of such submodules.

Semi-contraction is a withdrawal operation defined by Fermé in “On the logic of theory change: Contraction without recovery.” In this paper we propose: (1) an axiomatic characterization of semi-contraction; (2) an alternative construction for semi-contraction based on semi-saturatable sets, inspired by Levi’s saturatable sets; (3) a special kind of semi-contraction that satisfies the Lindström ...

An n-ary operation f : An → A is called cyclic, if it is idempotent and f(a1, a2, a3, . . . , an) = f(a2, a3, . . . , an, a1) for every a1, . . . , an ∈ A. We prove that every finite algebra A in a congruence modular variety has a p-ary cyclic term operation for any prime p greater than |A|.

We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF (2)-linear combination of Gold functions Tr(x i+1) is semi-bent over GF (2), n odd, by a polynomial GCD computation. By analyzing this GCD condition, we provide simpler characterizations of semi-bent functions. For example, we deduce that all linear combinations of Gold fu...

In this paper, we present a new class of semi-bent quadratic Boolean functions of the form f(x) = ∑⌊m−1 2 ⌋ i=1 Tr n 1 (cix 1+4i) (ci ∈ F4,n = 2m). We first characterize the semi-bentness of these quadratic Boolean functions. There exists semi-bent functions only when m is odd. For the case: m = p, where p is an odd prime with some conditions, we enumerate the semi-bent functions. Further, we g...

Quantum Computation is a growing and important field in applied physics research, so further theoretical foundations are continuously requested. In this regard, some mathematical algorithms have already been proposed. For instance, creating a quantum state representing the superposition of all prime number less than a value N has been shown to be efficient, and also applying the Quantum Fourier...

Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime implicants that covers the chosen minterm; third, it identifies the essential prime implicant; and fourth, it performs a covering operation. In this study, we focus on the third step and propose a new essential prime implica...

Last-Level Cache (LLC) attacks typically exploit timing side channels in hardware, and thus rely heavily on timers for their operation. Many proposed defenses against such side-channel attacks capitalize on this reliance. This paper presents PRIME+ABORT, a new cache attack which bypasses these defenses by not depending on timers for its function. Instead of a timing side channel, PRIME+ABORT le...