Extensive facility location problems on networks with equity measures

This paper deals with the problem of locating path-shaped facilities of unrestricted length on networks. We consider as objective functions measures conceptually related to the variability of the distribution of the distances from the demand points to a facility. We study the following problems: locating a path which minimizes the range, that is, the difference between the maximum and the minimum distance from the vertices of the network to a facility, and locating a path which minimizes a convex combination of the maximum and the minimum distance from the vertices of the network to a facility, also known in decision theory as the Hurwicz criterion. We show that these problems are NP-hard on general networks. For the discrete versions of these problems on trees, we provide a linear time algorithm for each objective function, and we show how our analysis can be extended also to the continuous case.     

A matrix-based approach to searching colored paths in a weighted colored multidigraph

An algebraic approach to finding all edge-weighted-colored paths within a weighted colored multidigraph is developed. Generally, the adjacency matrix represents a simple digraph and determines all paths between any two vertices, and is not readily extendable to colored multidigraphs. To bridge the gap, a conversion function is proposed to transform the original problem of searching edge-colored paths in a colored multidigraph to a standard problem of finding paths in a simple digraph. Moreover, edge weights can be used to represent some preference attribute. Its potentially wide realm of applicability is illustrated by a case study: status quo analysis in the graph model for conflict resolution. The explicit matrix function is more convenient than other graphical representations for computer implementation and for adapting to other applications. Additionally, the algebraic approach reveals the relationship between a colored multidigraph and a simple digraph, thereby providing new insights into algebraic graph theory.     

On representation theorem of <Emphasis Type="Italic">G</Emphasis>-expectations and paths of <Emphasis Type="Italic">G</Emphasis>-Brownian motion

We give a very simple and elementary proof of the existence of a weakly compact family of probability measures {Pθ ： θ∈θ} representing an important sublinear expectation- G-expectation E[·]. We also give a concrete approximation of a bounded continuous function X（ω） by an increasing sequence of cylinder functions Lip（Ω） in order to prove that Cb（Ω） belongs to the completion of Lip（Ω） under the natural norm E[｜·｜].     

On an extension of a combinatorial identity

Using Frobenius partitions we extend the main results of [4]. This leads to an infinite family of 4-way combinatorial identities. In some particular cases we get even 5-way combinatorial identities which give us four new combinatorial versions of Göllnitz-Gordon identities.     

An approximation algorithm for maximum triangle packing

We present a randomized -approximation algorithm for the weighted maximum triangle packing problem, for any given ε>0. This is the first algorithm for this problem whose performance guarantee is better than . The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem.     

Bijections between generalized Catalan families of types A and C

Motivated by the relation ${\mathsf{N}}^m\left(C_n\right)=(mn+1){\mathsf{N}}^m\left(A_{n?1}\right)$, holding for the $m$-generalized Catalan numbers of type $A$ and $C$, the connection between dominant regions of the $m$-Shi arrangement of type $A_{n?1}$ and $C_n$ is investigated. More precisely, it is explicitly shown how $mn+1$ copies of the set of dominant regions of the $m$-Shi arrangement of type $A_{n?1}$, biject onto the set of type $C_n$ such regions. This is achieved by exploiting two different viewpoints of the representative alcove of each region: the Shi tableau and the abacus diagram. In the same line of thought, a bijection between $mn+1$ copies of the set of $m$-Dyck paths of height $n$ and the set of $N?E$ lattice paths inside an $n\times mn$ rectangle is provided.     

Rainbow and orthogonal paths in factorizations of Kn

For n even, a factorization of a complete graph K_n is a partition of the edges into n?1 perfect matchings, called the factors of the factorization. With respect to a factorization, a path is called rainbow if its edges are from distinct factors. A rainbow Hamiltonian path takes exactly one edge from each factor and is called orthogonal to the factorization. It is known that not all factorizations have orthogonal paths. Assisted by a simple edge‐switching algorithm, here we show that for n?8, the rotational factorization of K_n, GK_n has orthogonal paths. We prove that this algorithm finds a rainbow path with at least (2n+1)/3 vertices in any factorization of K_n (in fact, in any proper coloring of K_n). We also give some problems and conjectures about the properties of the algorithm. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 167–176, 2010     

Vector invariants for the two-dimensional modular representation of a cyclic group of prime order

In this paper, we study the vector invariants of the 2-dimensional indecomposable representation V₂ of the cyclic group, Cp, of order p over a field F of characteristic p, FCp[mV₂]. This ring of invariants was first studied by David Richman (1990) [20] who showed that the ring required a generator of degree m(p−1), thus demonstrating that the result of Noether in characteristic 0 (that the ring of invariants of a finite group is always generated in degrees less than or equal to the order of the group) does not extend to the modular case. He also conjectured that a certain set of invariants was a generating set with a proof in the case p=2. This conjecture was proved by Campbell and Hughes (1997) in [3]. Later, Shank and Wehlau (2002) in [24] determined which elements in Richman's generating set were redundant thereby producing a minimal generating set.We give a new proof of the result of Campbell and Hughes, Shank and Wehlau giving a minimal algebra generating set for the ring of invariants FCp[mV₂]. In fact, our proof does much more. We show that our minimal generating set is also a SAGBI basis for FCp[mV₂]. Further, our results provide a procedure for finding an explicit decomposition of F[mV₂] into a direct sum of indecomposable Cp-modules. Finally, noting that our representation of Cp on V₂ is as the p-Sylow subgroup of SL₂(Fp), we describe a generating set for the ring of invariants F[mV₂]^SL₂(Fp) and show that (p+m−2)(p−1) is an upper bound for the Noether number, for m>2.     

Path homomorphisms,graph colorings,and boolean matrices

We investigate bounds on the chromatic number of a graph G derived from the nonexistence of homomorphisms from some path \begin{eqnarray*}\vec{P}\end{eqnarray*} into some orientation \begin{eqnarray*}\vec{G}\end{eqnarray*} of G. The condition is often efficiently verifiable using boolean matrix multiplications. However, the bound associated to a path \begin{eqnarray*}\vec{P}\end{eqnarray*} depends on the relation between the “algebraic length” and “derived algebraic length” of \begin{eqnarray*}\vec{P}\end{eqnarray*}. This suggests that paths yielding efficient bounds may be exponentially large with respect to G, and the corresponding heuristic may not be constructive. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 198–209, 2010     

Connectivity keeping paths in k‐connected graphs

A result of G. Chartrand, A. Kaugars, and D. R. Lick [Proc Amer Math Soc 32 (1972), 63–68] says that every finite, k‐connected graph G of minimum degree at least ?3k/2? contains a vertex x such that G?x is still k‐connected. We generalize this result by proving that every finite, k‐connected graph G of minimum degree at least ?3k/2?+m?1 for a positive integer m contains a path P of length m?1 such that G?V(P) is still k‐connected. This has been conjectured in a weaker form by S. Fujita and K. Kawarabayashi [J Combin Theory Ser B 98 (2008), 805–811]. © 2009 Wiley Periodicals, Inc. J Graph Theory 65: 61–69, 2010.