Tootfinder

"My vision of a world with computers is a world in which people have a lot more time to do what they like. Playing tennis, jogging… they’ll have plenty of time to go to the shore. I’d go to the library. I could do my work at home. I could have a computer at home and talk to my office. I could live up on top of a nice mountain in New Hampshire and smell pine trees and it would be the same as if I were here in the sub-sub-subbasement of the Pentagon."
– Grace Hopper

Grace Hopper & David Letterman
Among the many documents available at the Computer History Museum website there is an interesting artifact: a commercial brochure published in 1957 by the Remington Rand UNIVAC, "a division of Sperry Rand Corporation", titled "introducing a new language for automatic programming". In it, we learn about the advantages of the new (at the time) FLOW-MATIC programming language, the brainchild of United States Navy Rear Admiral Grace Murray Hopper.

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

An Output-Polynomial Time Algorithm to Determine all Supported Efficient Solutions for Multi-Objective Integer Network Flow Problems
This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). It derives an output-polynomial time algorithm to determine all supported efficient solutions for MOIMCF problems. This is the first approach to solve this general problem in output-polynomial time. Moreover, we prove that the existence of an output-polynomial time algorithm to determine all weakly supported nondominated vectors (or all weakl…

Penger styrer makta, uansett.
Å sette en grense på 5000,- per person eller organisasjon og kreve full åpenhet er bare plaster på såret i et system som er korrupt fra bunnen av.
Partipolitikk handler om å holde folket nede, ikke gi dem reell makt. En felles plattform for politikk? Bare enda en måte å kontrollere og temme opprŸr på.
La oss rive hele greia ned i stedet!

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

Overpartitions with separated overlined parts and non-overlined parts
Recently, Andrews considered the partitions with parts separated by parity, in which parts of a given parity are all smaller than those of the other parity. Inspired from the partitions with parts separated by parity, we investigate the overpartitions with separated overlined parts and non-overlined parts, in which the sizes of overlined parts (resp. non-overlined parts) are greater than or equal to those of non-overlined parts (resp. overlined parts).

Metsäjätit myyvät, luonto maksaa hinnan! Vaadi muutosta metsäyhtiöiden toimintaan! #luonto …

Metsäyhtiöt vastuuseen! Suomen luonto ei ole kertakäyttötuote - Greenpeace Suomi
Luontokato kiihtyy, hiilinielut romahtavat, mutta metsäyhtiöt jatkavat samaan malliin. Jotain rajaa! Allekirjoita vetoomus.

Improving Multi-Vehicle Perception Fusion with Millimeter-Wave Radar Assistance
Zhiqing Luo, Yi Wang, Yingying He, Wei Wang
https://arxiv.org/abs/2506.00837

Improving Multi-Vehicle Perception Fusion with Millimeter-Wave Radar Assistance
Cooperative perception enables vehicles to share sensor readings and has become a new paradigm to improve driving safety, where the key enabling technology for realizing this vision is to real-time and accurately align and fuse the perceptions. Recent advances to align the views rely on high-density LiDAR data or fine-grained image feature representations, which however fail to meet the requirements of accuracy, real-time, and adaptability for autonomous driving. To this end, we present MMatch,…

Incremental Gain Computation and Regulation of Discrete-time Positive Lur\'e Systems using Linear Programming
Jared Miller
https://arxiv.org/abs/2505.24386

Incremental Gain Computation and Regulation of Discrete-time Positive Luré Systems using Linear Programming
This work approaches the problem of computing incremental $\ell_1$ and $\ell_\infty$ gains for discrete-time positive systems in \lure feedback with static memoryless nonlinearities, and regulating the $\ell_\infty$ gain through the design of a state-feedback controller. Finite incremental gains provide a quantitative measure of robustness for trajectories, and will ensure that all pairs of trajectories will converge to a fixed point or will diverge together in the absence of an applied input. …

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

Complexity of the game connected domination problem
The connected domination game is a variation of the domination game where the played vertices must form a connected subgraph at all stages of the game. In this paper we prove that deciding whether the game connected domination number is smaller than a given integer is PSPACE-complete using log-space reductions for both Dominator- and Staller-start connected domination game.

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

Further Comments on Yablo's Construction
We continue our analysis of Yablo's coding of the liar paradox by infinite acyclic graphs. The present notes are based on and continue the author's previous results on the problem. In particular, our approach is often more systematic than before.

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

p-adic Equiangular Lines and p-adic van Lint-Seidel Relative Bound
We introduce the notion of p-adic equiangular lines and derive the first fundamental relation between common angle, dimension of the space and the number of lines. More precisely, we show that if $\{τ_j\}_{j=1}^n$ is p-adic $γ$-equiangular lines in $\mathbb{Q}^d_p$, then \begin{align*} (1) \quad\quad \quad \quad |n|^2\leq |d|\max\{|n|, γ^2 \}. \end{align*} We call Inequality (1) as the p-adic van Lint-Seidel relative bound. We believe that this complements funda…