Tootfinder

There is a type of manager whose concept of "leadership" is to pick a number, decide that the number should increase by an arbitrary amount; and communicate that number down to the grunts (who now have to do the manager's job of developing a strategy).
It's no surprise that the cause of the new world record for boomerang layoffs came out of such a "number must go up" moment: "you come to me with 20% layoffs? Make it bigger, or I will make it bigger for …

This https://arxiv.org/abs/2311.02045 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Hardy-type paradoxes for an arbitrary symmetric bipartite Bell scenario
As with a Bell inequality, Hardy's paradox manifests a contradiction between the prediction given by quantum theory and local-hidden variable theories. In this work, we give two generalizations of Hardy's arguments for manifesting such a paradox to an arbitrary, but symmetric Bell scenario involving two observers. Our constructions recover that of Meng et al. [Phys. Rev. A. 98, 062103 (2018)] and that first discussed by Cabello [Phys. Rev. A 65, 032108 (2002)] as special cases. Among the two co…

@… I also dislike generic/common/baseline nupkgs that contain a seemingly arbitrary collection of helpers used by the other nupkg of the same author.
I think this one is a stereotypical example:
ht…

Kudos to @… who today merged his largest pull request ever, consisting of 59 (well separated) commits introducing an important feature for the new Neos content repository. He and the team worked on this for almost 6 months! 👨‍💻

Matroid variant of Matiyasevich formula and its application
E. Yu. Lerner
https://arxiv.org/abs/2404.09347 https://arxiv.org/pdf/2404…

Matroid variant of Matiyasevich formula and its application
In 1977, Yu.V. Matiyasevich proposed a formula expressing the chromatic polynomial of an arbitrary graph as a linear combination of flow polynomials of subgraphs of the original graph. In this paper, we prove that this representation is a particular case of one (easily verifiable) formula, namely, the representation of the characteristic polynomial of an arbitrary matroid as a linear combination of characteristic polynomials of dual matroids. As applications, we consider an explicit expression …

Waveform Generator Teardown is Nearly Empty
https://poliverso.org/display/0477a01e-1e1051c6-3de90470076aef89
Waveform Generator Teardown is Nearly Empty We always enjoy [Kerry Wong’s] insightful teardowns, and recently, he opened up a UTG1042X arbit…

Important application idea for Linux desktops: Merge two images to one side-by-side. GUI, not CLI. Or don't even limit to two images but an arbitrary number in columns and rows. Using a fullblown image manipulation program for this task is PITA.
Usecase: I needed to show config settings side-by-side for a user. Maybe users need one day to show such a comparison to me and ask me how to do that.

Compliant Hierarchical Control for Arbitrary Equality and Inequality Tasks with Strict and Soft Priorities
Gianluca Garofalo
https://arxiv.org/abs/2403.08491

Compliant Hierarchical Control for Arbitrary Equality and Inequality Tasks with Strict and Soft Priorities
When a robotic system is redundant with respect to a given task, the remaining degrees of freedom can be used to satisfy additional objectives. With current robotic systems having more and more degrees of freedom, this can lead to an entire hierarchy of tasks that need to be solved according to given priorities. In this paper, the first compliant control strategy is presented that allows to consider an arbitrary number of equality and inequality tasks, while still preserving the natural inertia…

This https://arxiv.org/abs/2401.06857 has been replaced.
link: https://scholar.google.com/scholar?q=a

Low-Rank Tensor Decomposition over Finite Fields
We show that finding rank-$R$ decompositions of a 3D tensor, for $R\le 4$, over a fixed finite field can be done in polynomial time. However, if some cells in the tensor are allowed to have arbitrary values, then rank-2 is NP-hard over the integers modulo 2. We also explore rank-1 decomposition of a 3D tensor and of a matrix where some cells are allowed to have arbitrary values.

This https://arxiv.org/abs/2309.10959 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hepp…

BFBrain: Scalar Bounded-From-Below Conditions from Bayesian Active Learning
We present a procedure leveraging Bayesian deep active learning to rapidly produce highly accurate approximate bounded-from-below conditions for arbitrary renormalizable scalar potentials, in the form of a neural network which may be saved and exported for use in arbitrary parameter space scans. We explore the performance of our procedure on three different scalar potentials with either highly nontrivial or unknown symbolic bounded-from-below conditions (the two-Higgs doublet model, the three-H…