Distribution of polynomial coefficents, congruent modulo pN

1989 ◽  
Vol 45 (3) ◽  
pp. 195-199 ◽  
Author(s):  
N. A. Volodin
Keyword(s):  
Congruent Modulo

A LOWER BOUND FOR THE NUMBER OF FORBIDDEN MOVES TO UNKNOT A LONG VIRTUAL KNOT

2013 ◽  
Vol 22 (06) ◽  
pp. 1350024 ◽  
Author(s):  
MYEONG-JU JEONG
Keyword(s):  
Lower Bound ◽  
Finite Type ◽  
Finite Sequence ◽  
Virtual Knot ◽  
Virtual Knots ◽  
Finite Type Invariants ◽  
Combinatorial Representations ◽  
Congruent Modulo

Nelson and Kanenobu showed that forbidden moves unknot any virtual knot. Similarly a long virtual knot can be unknotted by a finite sequence of forbidden moves. Goussarov, Polyak and Viro introduced finite type invariants of virtual knots and long virtual knots and gave combinatorial representations of finite type invariants. We introduce Fn-moves which generalize the forbidden moves. Assume that two long virtual knots K and K′ are related by a finite sequence of Fn-moves. We show that the values of the finite type invariants of degree 2 of K and K′ are congruent modulo n and give a lower bound for the number of Fn-moves needed to transform K to K′.

scholarly journals Corrigendum: Block idempotents and the Brauer correspondence

1973 ◽  
Vol 8 (2) ◽  
pp. 319-319 ◽  
Author(s):  
Jon F. Carlson
Keyword(s):  
Congruent Modulo

Professor William F. Reynolds has discovered a mistake in the main theorem of [1]. The problem occurs with the first display on page 339 in that is only congruent modulo radZ(G) to . The theorem still holds if θ(radZ(G)) ⊆ radZ(H), but this is not the case in general.

Two Sums That Are Congruent Modulo p: 10723

2001 ◽  
Vol 108 (2) ◽  
pp. 176
Author(s):  
Christopher J. Hillar ◽  
Heinz-Jurgen Seiffert
Keyword(s):  
Modulo P ◽  
Congruent Modulo

Compatibility of arithmetic and algebraic local constants (the case )

2015 ◽  
Vol 151 (9) ◽  
pp. 1626-1646 ◽  
Author(s):  
Jan Nekovář
Keyword(s):  
Elliptic Curves ◽  
Prime Number ◽  
Galois Representations ◽  
Abelian Varieties ◽  
Selmer Groups ◽  
Real Multiplication ◽  
Special Cases ◽  
Congruent Modulo ◽  
Multiplication Theorem ◽  
Parity Conjecture

We show that arithmetic local constants attached by Mazur and Rubin to pairs of self-dual Galois representations which are congruent modulo a prime number $p>2$ are compatible with the usual local constants at all primes not dividing $p$ and in two special cases also at primes dividing $p$. We deduce new cases of the $p$-parity conjecture for Selmer groups of abelian varieties with real multiplication (Theorem 4.14) and elliptic curves (Theorem 5.10).

Wiener Number of Polyphenyls and Phenylenes

1994 ◽  
Vol 49 (11) ◽  
pp. 1040-1044 ◽  
Author(s):  
Ivan Gutman ◽  
Gyula Dömötör
Keyword(s):  
Discriminating Power ◽  
Wiener Number ◽  
Congruent Modulo

Abstract It is shown that the values which the Wiener numbers of isomeric polyphenyls may assume are all congruent modulo 36. Similarly, the Wiener numbers of isomeric phenylens are always congruent modulo 18. These findings provide a rationalization for the known fact that the isomer-discriminating power of the Wiener number is rather weak. Extensions of the present results to more general classes of graphs are also pointed out.

DIVISIBILITY OF DEDEKIND FINITE SETS

2005 ◽  
Vol 05 (01) ◽  
pp. 49-85
Author(s):  
DAVID BLAIR ◽  
ANDREAS BLASS ◽  
PAUL HOWARD
Keyword(s):  
Natural Number ◽  
Equal Size ◽  
Natural Numbers ◽  
Finite Sets ◽  
Finite Set ◽  
Finite Power ◽  
Congruent Modulo

A Dedekind-finite set is said to be divisible by a natural number n if it can be partitioned into pieces of size n. We study several aspects of this notion, as well as the stronger notion of being partitionable into n pieces of equal size. Among our results are that the divisors of a Dedekind-finite set can consistently be any set of natural numbers (containing 1 but not 0), that a Dedekind-finite power of 2 cannot be divisible by 3, and that a Dedekind-finite set can be congruent modulo 3, to all of 0, 1, and 2 simultaneously. (In these results, 2 and 3 serve as typical examples; the full results are more general.)

Probability and the elementary symmetric functions

1973 ◽  
Vol 74 (1) ◽  
pp. 133-139 ◽  
Author(s):  
J. Denmead Smith
Keyword(s):  
Symmetric Function ◽  
Symmetric Functions ◽  
Random Variables ◽  
Elementary Symmetric Function ◽  
Independent Random Variables ◽  
Elementary Symmetric Functions ◽  
Congruent Modulo

Let p be a prime, and suppose that x1,…,xN are independent random variables which take the values 0, 1,…,p − 1 with probabilities s0, sl…,sp−1 where s0+…+sp−1 = 1 and 0 < sk < 1 for each k. PN(n) denotes the probability that the elementary symmetric function σr(x1,…,xN) = ∑x1…,xr of the rth degree in the variables x1,…,xN is congruent, modulo p, to a prescribed integer n.

Sign in / Sign up

Export Citation Format

Share Document