Periodicity problem of substitutions over ternary alphabets
In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.
Periodicity Problem of Substitutions over Ternary Alphabets
In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.
Permanents, Pfaffian orientations, and even directed circuits.
Permutation of sparse matrices to a specific lower BFT using graph decompositions.
Permutations avoiding two patterns of length three.
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.
Planar graphs as minimal resolutions of trivariate monomial ideals.
Planar graphs with topological constraints.
Planar ordered sets of width two
Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments.
Planarity testing and optimal edge insertion with embedding constraints.
p-Median problems in a fuzzy environment.
In this paper a formulation for the fuzzy p-median model in a fuzzy environment is presented. The model allows to find optimal locations of p facilities and their related cost when data related to the node demands and the edge distances are imprecise and uncertain and also to know the degree of certainty of the solution. For the sake of illustration, the proposed model is applied in a reduced map of Kinshasa (Democratic Republic of Congo) obtaining results which are rather than realistic ones.
Polar coordinate drawing of planar graphs with good angular resolution.
Polyhedral Line Transversals in Space.
Polynomial languages with finite antidictionaries
We tackle the problem of studying which kind of functions can occur as complexity functions of formal languages of a certain type. We prove that an important narrow subclass of rational languages contains languages of polynomial complexity of any integer degree over any non-trivial alphabet.
Polynomial languages with finite antidictionaries
We tackle the problem of studying which kind of functions can occur as complexity functions of formal languages of a certain type. We prove that an important narrow subclass of rational languages contains languages of polynomial complexity of any integer degree over any non-trivial alphabet.
Polypodic codes
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.
Polypodic codes
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.
Porous media equation on locally finite graphs
In this paper, we consider two typical problems on a locally finite connected graph. The first one is to study the Bochner formula for the Laplacian operator on a locally finite connected graph. The other one is to obtain global nontrivial nonnegative solution to porous-media equation via the use of Aronson-Benilan argument. We use the curvature dimension condition to give a characterization two point graph. We also give a porous-media equation criterion about stochastic completeness of the graph....
Positive eigenvalues and two-letter generalized words.