Tootfinder

HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination
Tianyu Zhao, Dongfang Zhao, Luanzheng Guo, Nathan Tallent
https://arxiv.org/abs/2506.15844

HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination
Hypergraphs provide a natural representation for many-to-many relationships in data-intensive applications, yet their scalability is often hindered by high memory consumption. While prior work has improved computational efficiency, reducing the space overhead of hypergraph representations remains a major challenge. This paper presents a hybrid compression framework for integer-based hypergraph adjacency formats, which adaptively combines Huffman encoding and bitwise encoding to exploit structur…

On Tur\'{a}n problems for Berge forests
Junpeng Zhou, D\'aniel Gerbner, Xiying Yuan
https://arxiv.org/abs/2506.16140 https://…

On Turán problems for Berge forests
For a graph $F$, an $r$-uniform hypergraph $H$ is a Berge-$F$ if there is a bijection $ϕ:E(F)\rightarrow E(H)$ such that $e\subseteq ϕ(e)$ for each $e\in E(F)$. Given a family $\mathcal{F}$ of $r$-uniform hypergraphs, an $r$-uniform hypergraph is $\mathcal{F}$-free if it does not contain any member in $\mathcal{F}$ as a subhypergraph. The Turán number of $\mathcal{F}$ is the maximum number of hyperedges in an $\mathcal{F}$-free $r$-uniform hypergraph on $n$ vertices. In this paper, some exac…

EHCube4P: Learning Epistatic Patterns Through Hypercube Graph Convolution Neural Network for Protein Fitness Function Estimation
Muhammad Daud, Philippe Charton, Cedric Damour, Jingbo Wang, Frederic Cadet
https://arxiv.org/abs/2506.16921

EHCube4P: Learning Epistatic Patterns Through Hypercube Graph Convolution Neural Network for Protein Fitness Function Estimation
Understanding the relationship between protein sequences and their functions is fundamental to protein engineering, but this task is hindered by the combinatorially vast sequence space and the experimental noise inherent in fitness measurements. In this study, we present a novel framework that models the sequence landscape as a hypercube $H(k,2)$ and integrates wavelet-based signal denoising with a graph convolutional neural network (GCN) to predict protein fitness across rugged fitness landsca…

Quantum k-SAT Related Hypergraph Problems
Simon-Luca Kremer, Dorian Rudolph, Sevag Gharibian
https://arxiv.org/abs/2506.17066 https://

Quantum k-SAT Related Hypergraph Problems
The Quantum k-SAT problem is the quantum generalization of the k-SAT problem. It is the problem whether a given local Hamiltonian is frustration-free. Frustration-free means that the ground state of the k-local Hamiltonian minimizes the energy of every local interaction term simultaneously. This is a central question in quantum physics and a canonical QMA_1-complete problem. The Quantum k-SAT problem is not as well studied as the classical k-SAT problem in terms of special tractable cases, appr…

Flat Midgap Topological Surface and Hypersurface Bands without Parameter Tuning
Keun Hyuk Ahn
https://arxiv.org/abs/2506.16554 https://

Flat Midgap Topological Surface and Hypersurface Bands without Parameter Tuning
The Su-Schrieffer-Heeger model is extended to the three and higher dimensional systems. Nearly or absolutely flat midgap surface and hypersurface bands are predicted based on the topological analysis, which do not require fine tuning of parameters. By adding the on-site Coulomb interaction for the three dimensional systems, we computationally show that the large difference in the band widths between the surface and the bulk leads to the strongly correlated phenomena, specifically magnetism, con…

Cycle lengths in the percolated hypercube
Michael Anastos, Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich, Lyuben Lichev
https://arxiv.org/abs/2506.16858

Cycle lengths in the percolated hypercube
Let $Q^d_p$ be the random subgraph of the $d$-dimensional binary hypercube obtained after edge-percolation with probability $p$. It was shown recently by the authors that, for every $\varepsilon > 0$, there is some $c = c(\varepsilon)>0$ such that, if $pd\ge c$, then typically $Q^d_p$ contains a cycle of length at least $(1-\varepsilon)2^d$. We strengthen this result to show that, under the same assumptions, typically $Q^d_p$ contains cycles of all even lengths between $4$ and $(1-\varepsilon)2…

Électrique ou pas, la voiture citadine est un oxymore
https://www.lesoir.be/677186/article/2025-05-22/le-chinois-byd-sattaque-au-marche-de-la-citadine-electrique

If you ask your technical team to migrate off US cloud infrastructure, they’ll pull faces and ask “to where!?”
https://www.theregister.com/2025/05/22/ditching_us_clouds_for_local/

'Close to impossible' for Europe to escape clutches of US hyperscalers
: Barriers stack up: Datacenter capacity, egress fees, platform skills, variety of cloud services. It won't happen, say analysts

PyCon US wants its own time zone for the conference.
Make this make sense for me.
Why is this better and easier than just working in UTC?
If this request were granted (which it won't be) would they not have to be continually converting between local time and PyCon US time anyway? So why not just convert between local time and UTC and store every event in UTC?

PyCon US wants its own time zone for the conference.
Make this make sense for me.
Why is this better and easier than just working in UTC?
If this request were granted (which it won't be) would they not have to be continually converting between local time and PyCon US time anyway? So why not just convert between local time and UTC and store every event in UTC?