Let $\C$ be an essentially small abelian rigid braided monoidal category. We prove a reflection theorem for Nichols algebras in $\Ind(\C)$ and show that tuples admitting all reflections define connected semi-Cartan graphs. As applications, we prove that a finite Nichols algebra has a generating object of length at most...
The celebrated conjecture of Lov\'asz from 1969 asks whether every connected vertex-transitive graph has a Hamiltonian path. Buci\'c, Christoph, Pokrovskiy and Steiner recently proved that every such graph on $n$ vertices contains a cycle of length $n^{2/3-o(1)}$. In this paper, we improve this bound to $n^{1-o(1)}$. O...
We study a one‐dimensional rod‐cutting problem arising from an industrial setting where
cutting itself carries cost
. Each order specifies a length interval, and the task is to assign orders to warehouse rods so that all orders are satisfied while the
number of cuts
is minimized. This objective, which correspon...
Bo-Wen Li, A. Sali· International Transactions i...· 0 citations
The celebrated conjecture of Lov\'asz from 1969 asks whether every connected vertex-transitive graph has a Hamiltonian path. Buci\'c, Christoph, Pokrovskiy and Steiner recently proved that every such graph on $n$ vertices contains a cycle of length $n^{2/3-o(1)}$. In this paper, we improve this bound to $n^{1-o(1)}$. O...
The search for Hamiltonian cycles in vertex-transitive graphs and digraphs is a classical problem at the interface of graph theory and group theory. In the undirected setting, this goes back to the well-known conjectures of Lov\'asz and Thomassen concerning Hamiltonian paths and cycles in connected vertex-transitive gr...
Bowen Li, Abhishek Methuku· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.