Locally Restricted Compositions I. Restricted Adjacent Differences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally Restricted Compositions I. Restricted Adjacent Differences

We study compositions of the integer n in which the first part, successive differences, and the last part are constrained to lie in prescribed sets L,D,R, respectively. A simple condition on D guarantees that the generating function f(x,L,D,R) has only a simple pole on its circle of convergence and this at r(D), a function independent of L and R. Thus the number of compositions is asymptotic to...

متن کامل

Locally Restricted Compositions II. General Restrictions and Infinite Matrices

We study compositions ~c = (c1, . . . , ck) of the integer n in which the value ci of the ith part is constrained based on previous parts within a fixed distance of ci. The constraints may depend on i modulo some fixed integer m. Periodic constraints arise naturally when m-rowed compositions are written in a single row. We show that the number of compositions of n is asymptotic to Ar−n for some...

متن کامل

S-Restricted Compositions Revisited

An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years. This paper is an attempt at finding a closed-form formula for the number of S-restricted compositions of n. To do so, we reduce the problem to...

متن کامل

Locally Restricted Colorings of Graphs

Let G be a simple graph and f a function from the vertices of G to the set of positive integers. An (f, n)-coloring of G is an assignment of n colors to the vertices of G such that each vertex x is adjacent to less than f(x) vertices with the same color as x. The minimum n such that an (f, n)-coloring of G exists is defined to be the f chromatic number of G. In this paper, we address a study of...

متن کامل

Locally restricted blending of Blobtrees

Blobtrees are volume representations particularly useful for models which require smooth blending. When blending is applied to two or more Blobtree models, extra volume will be created in between the two surfaces to form a smooth connection. Although it is easy to apply blending, it is hard to accurately control the resulting shape. More complications arise when the blended objects have large s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2005

ISSN: 1077-8926

DOI: 10.37236/1954