Rings of functions with integer derivatives at x=1

Authors

  • D. L. Dowe
  • G. Petit
Abstract:

This article doesn't have abstract

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

An efficient extension of the Chebyshev cardinal functions for differential equations with coordinate derivatives of non-integer order

In this study, an effective numerical method for solving fractional differential equations using Chebyshev cardinal functions is presented. The fractional derivative is described in the Caputo sense. An operational matrix of fractional order integration is derived and is utilized to reduce the fractional differential equations to system of algebraic equations. In addition, illustrative examples...

full text

FUZZY IDEALS OF NEAR-RINGS WITH INTERVAL VALUED MEMBERSHIP FUNCTIONS

In this paper, for a complete lattice L, we introduce interval-valued L-fuzzy ideal (prime ideal) of a near-ring which is an extended notion of fuzzy ideal (prime ideal) of a near-ring. Some characterization and properties are discussed.

full text

Generalized Rings of Measurable and Continuous Functions

This paper is an attempt to generalize, simultaneously, the ring of real-valued continuous functions and the ring of real-valued measurable functions.

full text

Generalizations of Complemented Rings with Applications to Rings of Functions

It is well known that a commutative ring R is complemented (that is, given a ∈ R there exists b ∈ R such that ab = 0 and a + b is a regular element) if an only if the total ring of quotients of R is von Neumann regular. We consider generalizations of the notion of a complemented ring and their implications for the total ring of quotients. We then look at the specific case when the ring is a rin...

full text

Codes over Gaussian integer rings

This work presents block codes over Gaussian integer rings. Rings of Gaussian integers extend the number of possible QAM signal constellations over Gaussian integer fields. Many well-known code constructions can be used for codes over Gaussian integer rings, e.g., the Plotkin construction or product codes. These codes enable low complexity soft decoding in the complex domain.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 30  issue No. 1

pages  53- 67

publication date 2011-01-23

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023