scispace - formally typeset
Search or ask a question
Topic

Divisor

About: Divisor is a research topic. Over the lifetime, 2462 publications have been published within this topic receiving 21394 citations. The topic is also known as: factor & submultiple.


Papers
More filters
Patent
15 Oct 2008
TL;DR: In this paper, a method, system and digital modulator for modulation are provided, which includes a dividing mechanism for dividing a reference clock by a divisor value to produce a modulated signal associated with input data.
Abstract: A method, system and digital modulator for modulation are provided. The modulator includes a dividing mechanism for dividing a reference clock by a divisor value to produce a modulated signal associated with input data, and a control unit for providing at least one divisor sequence to the dividing mechanism. The divisor sequence is configurable and depends on the input data.
Book ChapterDOI
01 Jan 1986
TL;DR: In this paper, the authors consider only prime divisors of n and ask, for given order of magnitude of n, how many prime factors are there typically and how many different ones are there?
Abstract: Here we consider only prime divisors of n and ask, for given order of magnitude of n, “how many prime divisors are there typically?” and “how many different ones are there?” Some of the answers will be rather counterintuitive. Thus, a 50-digit number (1021 times the age of our universe measured in picoseconds) has only about 5 different prime factors on average and — even more surprisingly — 50-digit numbers have typically fewer than 6 prime factors in all, even counting repeated occurrences of the same prime factor as separate factors.
Posted Content
TL;DR: In this paper, the authors studied the characterizations of ample and big divisors via the corresponding line bundles of the integral part of a Weil non-integral divisor.
Abstract: Given a Weil non-integral divisor $D$, it is natural to associate it the line bundle of its integral part $\mathcal{O}_X([D])$. In this work we study which of the classical characterizations of ample and big divisors can be extended to non-integral divisors via the corresponding line bundles.
Posted Content
TL;DR: In this article, a Chevalley formula for the equivariant quantum cohomology of the odd symplectic Grassmannian (IG) with two orbits was proposed, which is a smooth Schubert variety in the submaximal isotropic Grassmannians.
Abstract: The odd symplectic Grassmannian $\mathrm{IG}:=\mathrm{IG}(k, 2n+1)$ parametrizes $k$ dimensional subspaces of $\mathbb{C}^{2n+1}$ which are isotropic with respect to a general (necessarily degenerate) symplectic form. The odd symplectic group acts on $\mathrm{IG}$ with two orbits, and $\mathrm{IG}$ is itself a smooth Schubert variety in the submaximal isotropic Grassmannian $\mathrm{IG}(k, 2n+2)$. We use the technique of curve neighborhoods to prove a Chevalley formula in the equivariant quantum cohomology of $\mathrm{IG}$, i.e. a formula to multiply a Schubert class by the Schubert divisor class. This generalizes a formula of Pech in the case $k=2$, and it gives an algorithm to calculate any multiplication in the equivariant quantum cohomology ring.
15 May 1972
TL;DR: Every possible nontrivial data frame subperiod and delayed subperiod may be derived by this organization of parallel modulo-m sub i counters.
Abstract: A modulo-M counter (of clock pulses) is decomposed into parallel modulo-m sub i counters, where each m sub i is a prime power divisor of M. The modulo-p sub i counters are feedback shift registers which cycle through p sub i distinct states. By this organization, every possible nontrivial data frame subperiod and delayed subperiod may be derived. The number of clock pulses required to bring every modulo-p sub i counter to a respective designated state or count is determined by the Chinese remainder theorem. This corresponds to the solution of simultaneous congruences over relatively prime moduli.

Network Information
Related Topics (5)
Conjecture
24.3K papers, 366K citations
93% related
Cohomology
21.5K papers, 389.8K citations
92% related
Holomorphic function
19.6K papers, 287.8K citations
91% related
Algebraic number
20.6K papers, 315.6K citations
90% related
Abelian group
30.1K papers, 409.4K citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
2021157
2020172
2019127
2018120
2017140