Direct Proof of Determinant Representation for Scalar Products of the XXZ Gaudin Model with Generic Non-Diagonal Boundary Terms

After constructing the Bethe state of the XXZ Gaudin model with generic non-diagonal boundary terms, we analyze the properties of this state and obtain the determinant representations of the scalar products for this XXZ Gaudin model.     

Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs

Let ${\overrightarrow{K}}_{\mathbb{N}}$ be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a 2-colouring of the edges of ${\overrightarrow{K}}_{\mathbb{N}}$ in which every monochromatic path has density 0.However, if we restrict the length of monochromatic paths in one colour, then no example as above can exist: We show that every $(r+1)$-edge-coloured complete symmetric digraph (of arbitrary infinite cardinality) containing no directed paths of edge-length ${?}_i$ for any colour $i\le r$ can be covered by ${\prod }_{i\in \left[r\right]}{?}_i$ pairwise disjoint monochromatic complete symmetric digraphs in colour $r+1$.Furthermore, we present a stability version for the countable case of the latter result: We prove that the edge-colouring is uniquely determined on a large subgraph, as soon as the upper density of monochromatic paths in colour $r+1$ is bounded by ${\prod }_{i\in \left[r\right]}\frac{1}{{?}_i}$.     

Layers and matroids for the traveling salesman’s paths

Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive “generalized Gao-trees”. We give a short proof of this fact, as a layered convex combination of bases of a sequence of increasingly restrictive matroids. A strongly polynomial, combinatorial algorithm follows for finding this convex combination, which is a new tool offering polyhedral insight, already instrumental in recent results for the $s?t$ path TSP.     

A multiplication operation for the hierarchy of norms

Assuming $\mathsf{AD}+\mathsf{DC}$, the hierarchy of norms is a wellordered structure of equivalence classes of ordinal-valued maps. We define operations on the hierarchy of norms, in particular an operation that dominates multiplication as an operation on the ranks of norms, and use these operations to establish a considerably improved lower bound for the length of the hierarchy of norms.     

How to determine a partition up to conjugation using multisets of hook lengths

If two partitions are conjugate, their multisets of hook lengths are the same. Then one may wonder whether the multiset of hook lengths of a partition determines a partition up to conjugation. The answer turns out to be no. However, we may add an extra condition under which a given multiset of hook lengths determines a partition uniquely up to conjugation. Herman-Chung, and later Morotti found such a condition. We give an alternative proof of Morotti’s theorem and generalize it.     

Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications

In this paper, we first give a dual characterization for set containments defined by lower semi-continuous and sublinear functions on Banach spaces. Next, we provide dual characterizations for robust polyhedral containments where a robust counterpart of an uncertain polyhedral set is contained in another polyhedral set or a polyhedral set is contained in a robust counterpart of an uncertain polyhedral set. Finally, as an application, we derive Lagrange multiplier characterizations for robust solutions of the robust uncertain linear programming problems.     

Partitioning the edge set of a hypergraph into almost regular cycles

A cycle of length t in a hypergraph is an alternating sequence of distinct vertices and distinct edges so that (with ). Let be the λ‐fold n‐vertex complete h‐graph. Let be a hypergraph all of whose edges are of size at least h, and . In order to partition the edge set of into cycles of specified lengths , an obvious necessary condition is that . We show that this condition is sufficient in the following cases.

• (R1) .
• (R2) , .
• (R3) , , .

In (R2), we guarantee that each cycle is almost regular. In (R3), we also solve the case where a “small” subset L of edges of is removed.     

三维弹性问题高次有限元方程的代数多层网格法

有限元法是数值求解三维弹性问题的一类重要的离散化方法,高次有限元又是其中的一类常用有限元。由于高次元对问题具有更好的逼近效果及具有某些特殊的优点,如能解决弹性问题的闭锁现象(Poisson’s ratio locking),使得它们在实际计算中被广泛使用。但与线性元相比,它具有更高的计算复杂性。通过分析高次有限元空间与线性有限元空间之间的关系,提出了一种求解三维弹性问题高次有限元方程的两水平方法,然后,通过调用现有的代数多层网格法求解粗水平方程,建立了求解高次有限元方程的AMG法。数值实验表明,本文设计的AMG法对求解三维弹性问题高次有限元方程具有很好的计算效率和鲁棒性。