It is shown that for any sufficiently regular even Minkowski valuation Φ which homogeneous and intertwines rigid motions, convex body K in a smooth neighborhood of the unit ball, there exists sequence positive numbers (γm)m=1∞ such (γmΦmK)m=1∞ converges to ball with respect Hausdorff metric.

in this paper we study the existence of commuting regular elements, verifying the notion left (right) commuting regular elements and its properties in the groupoid g(n) . also we show that g(n) contains commuting regular subsemigroup and give a necessary and sucient condition for the groupoid g(n) to be commuting regular.

Let A be a finite set and X a sequence of A-valued random variables. We do not assume any particular correlation structure between these random variables; in particular, X may be a non-Markovian sequence. An adapted embedding of X is a sequence of the form R(X1), R(X1, X2), R(X1, X2, X3), etc where R is a transformation defined over finite length sequences. In this extended abstract we characte...

The $n$th term of an automatic sequence is the output a deterministic finite automaton fed with representation $n$ in suitable numeration system. In this paper, instead considering sequences built on system regular language, we consider those languages associated trees having periodic labeled signatures and, particular, rational base systems. We obtain two main characterizations these sequences...

Abstract This paper gives moduli of analytic classification for parabolic Dulac germs (that is, almost regular germs). appear as first return maps hyperbolic polycycles. Their are given by a sequence Écalle–Voronin -type diffeomorphisms. The result is stated in broader class generalized having power- logarithmic asymptotic expansions. Bibliography: 23 titles.

In recent years, much work has been done on the classification of abstract regular polytopes by their local and global topological type. Abstract regular polytopes are combinatorial structures which generalize the wellknown classical geometric regular polytopes and tessellations. In this context, the classical theory is concerned with those which are of globally or locally spherical type. In a ...

We present some related families of orthogonal polynomials of a discrete variable and survey some of their applications in the study of (distance-regular) graphs and (completely regular) codes. One of the main peculiarities of such orthogonal systems is their non-standard normalization condition, requiring that the square norm of each polynomial must equal its value at a given point of the mesh...

It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pushdown automata and investigate, with a particular stress on effectiveness and complexity, the natural notion of regularity for higher-order stacks: a set of level k stacks is regular if it is obtained by a regular sequence of ...

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we introduce regular, pseudo-regular, and almost regular matrices. Nonnegative, symmetric, almost regular matrices were studied earlier by Ho¤man, Wolfe, and Ho¤...

Given a 0-dimensional affine K-algebra R=K[x1,…,xn]∕I, where I is an ideal in polynomial ring K[x1,…,xn] over field K, or, equivalently, given scheme, we construct effective algorithms for checking whether R complete intersection at maximal ideal, locally intersection, and strict intersection. These are based on Wiebe’s characterization of local intersections via the 0-th Fitting ideal. They al...