Displaying similar documents to “The MacNeille completion of the poset of partial injective functions.”

Value-peaks of permutations.

Bouchard, Pierre, Chang, Hungyung, Ma, Jun, Yeh, Jean, Yeh, Yeong-Nan (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A modified state variable diagram method for determination of positive realizations of linear continuous-time systems with delays

Tadeusz Kaczorek (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

A new modified state variable diagram method is proposed for determination of positive realizations of linear continuoustime systems with delays in state and input vectors. Using the method, it is possible to find a positive realization with reduced numbers of delays for a given transfer matrix. Sufficient conditions for the existence of positive realizations of given proper transfer matrices are established. The proposed method is demonstrated on numerical examples.

The Hausdorff dimension of some special plane sets

Jan Mařík (1994)

Mathematica Bohemica

Similarity:

A compact set T ⊂ 𝐑 2 is constructed such that each horizontal or vertical line intersects T in at most one point while the α -dimensional measure of T is infinite for every α ∈ ( 0 , 2 ) .

A cohomological index of Fuller type for parameterized set-valued maps in normed spaces

Robert Skiba (2014)

Open Mathematics

Similarity:

We construct a cohomological index of the Fuller type for set-valued flows in normed linear spaces satisfying the properties of existence, excision, additivity, homotopy and topological invariance. In particular, the constructed index detects periodic orbits and stationary points of set-valued dynamical systems, i.e., those generated by differential inclusions. The basic methods to calculate the index are also presented.

Restricted partitions and q-Pell numbers

Toufik Mansour, Mark Shattuck (2011)

Open Mathematics

Similarity:

In this paper, we provide new combinatorial interpretations for the Pell numbers p n in terms of finite set partitions. In particular, we identify six classes of partitions of size n, each avoiding a set of three classical patterns of length four, all of which have cardinality given by p n. By restricting the statistic recording the number of inversions to one of these classes, and taking it jointly with the statistic recording the number of blocks, we obtain a new polynomial generalization...