相关论文: On circuits and serial symmetric basis-exchange in…
In this text we study billiards on ovals and investigate some consequences of a rotational symmetry of the boundary on the dynamics. As it simplifies some calculations, the symmetry helps to obtain the results. We focus on periodic orbits…
The expansion axiom of matroids requires only the existence of some kind of independent sets, not the uniqueness of them. This causes that the base families of some matroids can be reduced while the unions of the base families of these…
We study a spin system with two- and four-spin exchange interactions on the triangular lattice, which is a possible model for the nuclear magnetism of solid $^3$He layers. It is found that a novel spin structure with scalar chiral order…
Model independent expressions for all polarization observables in $\mu+p\to \mu+p$ elastic scattering are obtained, taking into account the lepton mass and including the two-photon exchange contribution. The spin structure of the matrix…
For 2 by 2 matrices over commutative rings, we prove a characterization theorem for left stable range 1 elements, we show that the stable range 1 property is left-right symmetric (also) at element level, we show that all matrices with one…
Properties of the two dimensional Ising model with fixed magnetization are deduced from known exact results on the two dimensional Ising model. The existence of a continuous phase transition is shown for arbitrary values of the fixed…
We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given…
Given an assignment of real weights to the ground elements of a matroid, the min-max weight of a ground element $e$ is the minimum, over all circuits containing $e$, of the maximum weight of an element in that circuit with the element $e$…
A matroid M is cyclically orderable if there is a cyclic permutation of the elements of M such that any r consecutive elements form a basis in M. An old conjecture of Kajitani, Miyano, and Ueno states that a matroid M is cyclically…
We study the effects of quantum fluctuations on a non-coplanar tetrahedral spin structure, which has a scalar chiral order, in the spin-1/2 multiple-spin exchange model with up to the six-spin exchange interactions on a triangular lattice.…
This note generalizes a result contained in a previous paper [ J. Sanders, Circuit preserving edge maps II, J. Combin. Theory Ser. B 42 (1987), 146-155].
We study the full counting statistics for the transmission of two identical particles with positive or negative symmetry under exchange for the situation where the scattering depends on energy. We find that, besides the expected sensitivity…
Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…
Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected.
In general, the splitting operation on binary matroids does not preserve the graphicness and cographicness properties of binary matroids. In this paper, we obtain a characterization of the class of graphic matroids whose splitting with…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…
We address a specific case of the matroid intersection problem: given a set of graphs sharing the same set of vertices, select a minimum cycle basis for each graph to maximize the size of their intersection. We provide a comprehensive…
The concept of exchange in strongly-correlated fermions is reviewed with emphasis on the generalization of the Heisenberg pair exchange to higher order n-particle permutations. The "frustration" resulting from competing ferromagnetic…
A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…