Rigorous spectral representation of relativistic random phase approximation for finite nuclei

By using the rigorous spectral representation of relativistic random phase approximation, the low-lying excitation of finite nuclei and its longitudinal response function for quasielastic electron scattering are calculated in the σ-ω model of quantum hadrodynamics. It is shown that the reproduction of the correct order of the 1- and 3- excitation states of 16O is due to the contribution of the exchange vertex. There is no significant influence of the retardation effect on the low-lying excitation states. In contrast, the retardation effect plays an important role in the electron scattering process of nuclei. The theoretical longitudinal responses of 12C and 40Ca, including the contributions of the exchange vertex and the retardation effect, are suppressed and reproduce the experimental data better than the results excluding them.     

Fulop-Tsutsui interactions on quantum graphs

We examine scale invariant Fulop-Tsutsui couplings in a quantum vertex of a general degree n. We demonstrate that essentially same scattering amplitudes as for the free coupling can be achieved for two (n−1)-parameter Fulop-Tsutsui subfamilies if n is odd, and for three (n−1)-parameter Fulop-Tsutsui subfamilies if n is even. We also work up an approximation scheme for a general Fulop-Tsutsui vertex, using only n δ function potentials.     

Calculus students’ understanding of the vertex of the quadratic function in relation to the concept of derivative

The purpose of this study was to gain insight into 30, first year calculus students’ understanding of the relationship between the concept of vertex of a quadratic function and the concept of the derivative. APOS (action-process-object-schema) theory was applied as a guiding framework of analysis on student written work, think-aloud and follow up group interviews. Students’ personal meanings of the vertex, including misconceptions, were explored, along with students’ understanding to solve problems pertaining to the derivative of a quadratic function. Results give evidence of students’ weak schema of the vertex, lack of connection between different problem types and the importance of linguistics in relation to levels of APOS theory. A preliminary genetic decomposition was developed based on the results. Future research is suggested as a continuation to improve student understanding of the relationship between the vertex of quadratic functions and the derivative.     

An exact algorithm for solving the bilevel facility interdiction and fortification problem

We present an exact approach for solving the $r$-interdiction median problem with fortification. Our approach consists of solving a greedy heuristic and a set cover problem iteratively that guarantees to find an optimal solution upon termination. The greedy heuristic obtains a feasible solution to the problem, and the set cover problem is solved to verify optimality of the solution and to provide a direction for improvement if not optimal. We demonstrate the performance of the algorithm in a computational study.     

Graphs vertex-partitionable into strong cliques

A clique in a graph is strong if it intersects all maximal independent sets. A graph is localizable if it has a partition of the vertex set into strong cliques. Localizable graphs were introduced by Yamashita and Kameda in 1999 and form a rich class of well-covered graphs that coincides with the class of well-covered graphs within the class of perfect graphs. In this paper, we give several equivalent formulations of the property of localizability and develop polynomially testable characterizations of localizable graphs within three non-perfect graph classes: triangle-free graphs, $C_4$-free graphs, and line graphs. Furthermore, we use localizable graphs to construct an infinite family of counterexamples to a conjecture due to Zaare-Nahandi about $k$-partite well-covered graphs having all maximal cliques of size $k$.     

Regularity and projective dimension of edge ideals

In this paper, we study the regularity and projective dimension of edge ideals. We provide two upper bounds for the regularity of edge ideals of vertex decomposable graphs in terms of the induced matching number and the number of cycles. Also, we generalize one of the upper bounds given by Dao and Schweig for the projective dimension of hypergraphs.     

Rings whose cyclic modules are lifting and ⊕-supplemented

It is proved that a semiperfect module is lifting if and only if it has a projective cover preserving direct summands. Three corollaries are obtained: (1) every cyclic module over a ring R is lifting if and only if every cyclic R-module has a projective cover preserving direct summands; (2) a ring R is artinian serial with Jacobson radical square-zero if and only if every (2-generated) R-module has a projective cover preserving direct summands; (3) a ring R is a right (semi-)perfect ring if and only if (cyclic) lifting R-module has a projective cover preserving direct summands, if and only if every (cyclic) R-module having a projective cover preserving direct summands is lifting. It is also proved that every cyclic module over a ring R is ⊕-supplemented if and only if every cyclic R-module is a direct sum of local modules. Consequently, a ring R is artinian serial if and only if every left and right R-module is a direct sum of local modules.     

覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。     

Strong embeddings of minimum genus

A “folklore conjecture, probably due to Tutte” (as described in [P.D. Seymour, Sums of circuits, in: Graph Theory and Related Topics (Proc. Conf., Univ. Waterloo, 1977), Academic Press, 1979, pp. 341-355]) asserts that every bridgeless cubic graph can be embedded on a surface of its own genus in such a way that the face boundaries are cycles of the graph. Sporadic counterexamples to this conjecture have been known since the late 1970s. In this paper we consider closed 2-cell embeddings of graphs and show that certain (cubic) graphs (of any fixed genus) have closed 2-cell embedding only in surfaces whose genus is very large (proportional to the order of these graphs), thus providing a plethora of strong counterexamples to the above conjecture. The main result yielding such counterexamples may be of independent interest.