Tootfinder

Today I discovered the use of:
width: 0;
min-width: 100%;
This forces an element's intrinsic width to be 0, while its actual width is still equal to the parent's width.
As a result, the parent element's default width calculations will ignore this element and only consider its siblings.

Contemplating what I'm doing with my life instead of not joining #OSFair2025 and #RSEcon2025..
At least #OSFair2025 is recorded but this week has been mega hectic and I can't even get to that
I'm hoping to land in more quiet times and do some more tooting soon!

Woo! Got Intext EPROM working on my Epson HX-20 after quite a fight!
After Ghidra'ing the ROM dump to figure out what the error it was giving was about, I figured out it needed me to go through BASIC and do a CLEAR to specify a 'ram file' size for it to use.
Now, to figure out a Ghidra patch.
#retrocomputing

Constraint satisfaction problems, compactness and non-measurable sets
Claude Tardif
https://arxiv.org/abs/2508.14838 https://arxiv.org/pdf/2508.14838

Constraint satisfaction problems, compactness and non-measurable sets
A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to A. We show that if A has width one, then the compactness of A can be proved in the axiom system of Zermelo and Fraenkel, but otherwise, the compactness of A implies the existence of non-measurable sets in 3-space.

I woke up at 2am (I'm having trouble sleeping), saw that production was down, saw that I can't fix it myself, and sent an email looking for a fix. Do I leave it down and go back to sleep?

Oh no the YouTube bullshit of substituting perfectly fine real videos (shorts) with very obvious AI without the creators consent just reached my timeline

FPGA Design and Implementation of Fixed-Point Fast Divider Using Goldschmidt Division Algorithm and Mitchell Multiplication Algorithm
Jinkun Yang
https://arxiv.org/abs/2508.14611

FPGA Design and Implementation of Fixed-Point Fast Divider Using Goldschmidt Division Algorithm and Mitchell Multiplication Algorithm
This paper presents a variable bit-width fixed-point fast divider using Goldschmidt division algorithm and Mitchell multiplication algorithm. Described using Verilog HDL and implemented on a Xilinx XC7Z020-2CLG400I FPGA, the proposed divider achieves over 99% computational accuracy with a minimum latency of 99.1 ns, which is 31.7 ns faster than existing single-precision dividers. Compared with a Goldschmidt divider using a Vedic multiplier, the proposed design reduces Slice Registers by 46.68%,…

The role of angular slit number and angular slit width on the OAM spectrum
Jayson P. Cabanilla, Nathaniel Hermosa
https://arxiv.org/abs/2509.13829 https://…

The role of angular slit number and angular slit width on the OAM spectrum
The uncertainty principle sets the limit for simultaneous measurements of position and momentum, and its angular analogue is realized through angular diffraction. When a beam is spatially confined by angular slits, the uncertainty in its orbital angular momentum (OAM) increases, leading to the generation of OAM sidebands. Both the angular slit number and the angular slit width shapes the spatial confinement of the beam. In this study, we investigate this dependence of the OAM sidebands by obstr…

The Hidden Width of Deep ResNets: Tight Error Bounds and Phase Diagrams
L\'ena\"ic Chizat
https://arxiv.org/abs/2509.10167 https://arxiv.org/pdf/2…

The Hidden Width of Deep ResNets: Tight Error Bounds and Phase Diagrams
We study the gradient-based training of large-depth residual networks (ResNets) from standard random initializations. We show that with a diverging depth $L$, a fixed embedding dimension $D$, and an arbitrary hidden width $M$, the training dynamics converges to a Neural Mean ODE training dynamics. Remarkably, the limit is independent of the scaling of $M$, covering practical cases of, say, Transformers, where $M$ (the number of hidden units or attention heads per layer) is typically of the orde…

«The fundamental problem is this: that most of the means of communication are owned or influenced by the very rich. If democracy is the problem capital is always trying to solve, propaganda is part of the solution.»
On the epistemic crisis we're all in, thanks to most ways of knowing and disseminating knowledge being in the hands of a couple of billionaires.
https://www.theguardian.com/commentisfree/2025/nov/14/climate-crisis-communication-super-rich

Development and testing of integrated readout electronics for next generation SiSeRO (Single electron Sensitive Read Out) devices
Tanmoy Chattopadhyay, Haley R. Stueber, Abigail Y. Pan, Sven Herrmann, Peter Orel, Kevan Donlon, Steven W. Allen, Marshall W. Bautz, Michael Cooper, Catherine E. Grant, Beverly LaMarr, Christopher Leitz, Andrew Malonis, Eric D. Miller, R. Glenn Morris, Gregory Prigozhin, Ilya Prigozhin, Artem Poliszczuk, Keith Warner, Daniel R. Wilkins

Development and testing of integrated readout electronics for next generation SiSeRO (Single electron Sensitive Read Out) devices
The first generation of Single electron Sensitive Read Out (SiSeRO) amplifiers, employed as on-chip charge detectors for charge-coupled devices (CCDs) have demonstrated excellent noise and spectral performance: a responsivity of around 800 pA per electron, an equivalent noise charge (ENC) of 3.2 electrons root mean square (RMS), and a full width half maximum (FWHM) energy resolution of 130 eV at 5.9 keV for a readout speed of 625 Kpixel/s. Repetitive Non Destructive Readout (RNDR) has also been…

Balancing Extensions in Posets of Large Width
Max Aires, Jeff Kahn
https://arxiv.org/abs/2509.11549 https://arxiv.org/pdf/2509.11549

Balancing Extensions in Posets of Large Width
We revisit classic balancing problems for linear extensions of a partially ordered set $P$, proving results that go far beyond many of the best earlier results on this topic. For example, with $p(x\prec y)$ the probability that $x$ precedes $y$ in a uniform linear extension, $δ_{xy} = \min\{p(x \prec y), p(y \prec x)\}$, and $δ(P)=\max δ_{xy}$, we show that $δ(P)$ tends to $1/2$ as $n := |P| \to\infty$ if $P$ has width $Ω(n)$ or $ω(\log(n))$ minimal elements, and is at least $1/…

Jahn-Teller-like Distortion in a One-dimensional {\pi}-Conjugated Polymer
Ziyi Wang, Boyu Qie, Weichen Tang, Jingwei Jiang, Fujia Liu, Peter H. Jacobse, Jiaming Lu, Xinheng Li, Steven G. Louie, Felix R. Fischer, Michael F. Crommie
https://arxiv.org/abs/2508.14416

Jahn-Teller-like Distortion in a One-dimensional π-Conjugated Polymer
Structurally distorting low-dimensional π-conjugated systems can profoundly influence their electronic properties, but controlling such behavior in extended-width systems remains challenging. Here we demonstrate that a one-dimensional conjugated polymer, poly-(difluorenoheptalene-ethynylene) (PDFHE), undergoes a pronounced out-of-plane backbone distortion, equivalent to a spontaneous symmetry breaking (SSB) of its mirror symmetry. We synthesized PDFHE on noble metal surfaces and characterized …

There should be a DRTM emoji.
Here is my proposal:
👩‍⚕️‍™️
Yes, that is a health worker (Dr.), zero-width joiner, and trademark (tm). :D

I just found a relatively new tool for syntax-aware diff/merge operations on git repositories ( #Mergiraf ).
Unlike other tools I've tried in the past, this one is also diff3-friendly .
- https://mergiraf.org/
- https://lwn.net/Articles/1042355/
For the weirdos like me who prefer `rebase` over `merge` this can be a great mood & productivity booster

Excitation of toroidal Alfv\'en eigenmode by energetic particles in DTT and effect of negative triangularity
Guangyu Wei, Fulvio Zonca, Matteo Valerio Falessi, Zhiyong Qiu
https://arxiv.org/abs/2508.14622

Excitation of toroidal Alfvén eigenmode by energetic particles in DTT and effect of negative triangularity
A linear gyrokinetic eigenvalue code is developed to study the stability of toroidal Alfvén eigenmode (TAE) in general axisymmetric toroidal geometry, with the self-consistent treatment of energetic particle drive and core plasma Landau damping in a non-perturbative way. The general particle responses of both circulating and trapped particles are incorporated in the calculation by means of the action-angle approach, and, particularly, the finite Larmor radius and orbit width effects of energet…

Generalized probabilistic approximation characteristic based on Birkhoff orthogonality and related conclusions in $S_{\infty}$-norm
Weiye Zhang, Chong Wang, Huan Li
https://arxiv.org/abs/2509.10458

Generalized probabilistic approximation characteristic based on Birkhoff orthogonality and related conclusions in $S_{\infty}$-norm
In this article, we generalize the definition of the probabilistic Gel'fand width from the Hilbert space to the strictly convex reflexive space by giving Birkhoff left orthogonal decomposition theorem. Meanwhile, a more natural definition of Gel'fand width in the classical setting is selected to make sure probabilistic and average Gel'fand widths will not lose their meaning, so that we can give the equality relation between the probabilistic Gel'fand width and the probabilistic linear width of …

Musl support finally merged in upstream Systemd!!

Finite Volumes for a dissipative free boundary problem
Cl\'ement Canc\`es, Claire Chainais-Hillairet, Am\'elie Dupouy
https://arxiv.org/abs/2509.14908 https://

Finite Volumes for a dissipative free boundary problem
We study a toy model for the evolution of the oxygen concentration in an oxide layer. It consists in a transient convection diffusion equation in a one-dimensional domain of variable width. The motions of the boundaries are governed by the traces of the concentration. We exhibit a necessary and sufficient condition on the parameters involved in the model for the existence of a unique traveling-wave solution. Moreover, we show that the model admits some universal entropy structure, in the sense …

Zero-energy resonances in ultracold hydrogen sticking to liquid helium films of finite thickness
R. Karahanyan, A. Voronin, V. Nesvizhevsky, A. Semakin, S. Vasiliev
https://arxiv.org/abs/2509.14652

Zero-energy resonances in ultracold hydrogen sticking to liquid helium films of finite thickness
We investigated quantum states of ultracold hydrogen atoms in a combined potential comprising the H-He film interaction in the presence of a substrate and the Earth gravitational field. We show that the shift and width of the gravitational quantum states are determined by the complex scattering length for the H-He film-substrate potential. We demonstrate that for specific helium film thicknesses above a substrate, zero-energy resonances occur if the combined potential supports a bound state exa…

Tree-width of a graph excluding an apex-forest or a wheel as a minor
Chun-Hung Liu, Youngho Yoo
https://arxiv.org/abs/2509.09895 https://arxiv.org/pdf/2509…

Tree-width of a graph excluding an apex-forest or a wheel as a minor
The Grid Minor Theorem states that for every planar graph $H$, there exists a smallest integer $f(H)$ such that every graph with tree-width at least $f(H)$ contains $H$ as a minor. The only known lower bounds on $f(H)$ beyond the trivial bound $f(H)\geq |V(H)|-1$ come from the maximum number of disjoint cycles in $H$. In this paper, we study $f(H)$ for planar graphs $H$ with no two disjoint cycles. We prove that $f(H)=|V(H)|-1$ for every apex-forest $H$. This result improves…

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
Ambroise Baril, Miguel Couceiro, Victor Lagerkvist
https://arxiv.org/abs/2509.05122

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
The $H$-Coloring problem is a well-known generalization of the classical NP-complete problem $k$-Coloring where the task is to determine whether an input graph admits a homomorphism to the template graph $H$. This problem has been the subject of intense theoretical research and in this article we study the complexity of $H$-Coloring with respect to the parameters clique-width and the more recent component twin-width, which describe desirable computational properties of graphs. We give two surpr…

<blockquote class="twitter-tweet" data-media-max-width="560"><p lang="en" dir="ltr">🚨Wow. ABC created a supercut of Donald Trump calling Kamala Harris a Fascist: <a href="https://t.co/r5Plb486od">

CALL TO ACTIVISM (@CalltoActivism) on X
Jessica Tarlov on Fox News (2024): “Donald Trump calls Kamala a fascist quite regularly. Not only does he call her a fascist, he calls her a communist… So spare me.”

Theory of Scaling Laws for In-Context Regression: Depth, Width, Context and Time
Blake Bordelon, Mary I. Letey, Cengiz Pehlevan
https://arxiv.org/abs/2510.01098 https://

Theory of Scaling Laws for In-Context Regression: Depth, Width, Context and Time
We study in-context learning (ICL) of linear regression in a deep linear self-attention model, characterizing how performance depends on various computational and statistical resources (width, depth, number of training steps, batch size and data per context). In a joint limit where data dimension, context length, and residual stream width scale proportionally, we analyze the limiting asymptotics for three ICL settings: (1) isotropic covariates and tasks (ISO), (2) fixed and structured covarianc…

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler
https://arxiv.org/abs/2510.08378

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems $\mathsf{Hamiltonian\ Path}$ and $\mathsf{Hamiltonian\ Cycle}$ are in $\mathsf{FPT}$. In particular, we focus on parameters that describe how many vertices and edges have to be deleted to become a member of a certain graph class. We show that the problems are $\mathsf{W[1]}$…

I walk a lonely road
The only one that I have ever known
This thing's way too slow
But I've got IDA, and a vTune dump
I walk this empty street
From the L3 cache to DDR
When the mutex sleeps
And I'm the only one, and I walk alone
I walk alone, I walk alone
I walk alone, I walk a-
Debugger's the only one that touches vectors
Single width floats the only thing that's moving
(This is a first draft I need to spend…

Estimation of intrinsic fast radio burst width and scattering distributions from CRAFT data
C. W. James, J. Hoffmann, J. X. Prochaska, M. Glowacki
https://arxiv.org/abs/2510.05654

Estimation of intrinsic fast radio burst width and scattering distributions from CRAFT data
The intrinsic width and scattering distributions of fast radio bursts (FRBs) inform on their emission mechanism and local environment, and act as a source of detection bias and, hence, an obfuscating factor when performing FRB population and cosmological studies. Here, we utilise a sample of 29 FRBs with measured high-time-resolution properties and known redshift, which were detected using the Australian Square Kilometre Array Pathfinder (ASKAP) by the Commensal Real-time ASKAP Fast Transients …

Hands-on with the iPhone 17 Pro and 17 Pro Max: refreshing bold colors, soft matte unibody aluminum frame, and a nice two-tone back with a full-width camera bar (The Verge)
https://www.theverge.com/tech/773082/iphone-17-pro-max-hands-on-apple…

Our first look at the iPhone 17 Pro and 17 Pro Max
Apple just announced its various iPhone 17 models, and we got our hands on the flagship iPhone 17 Pro and Pro Max models — including their new, larger rear camera bars.

Selective and marginal selective inference for exceptional groups
Peter Hoff, Surya Tokdar
https://arxiv.org/abs/2509.13538 https://arxiv.org/pdf/2509.1353…

Selective and marginal selective inference for exceptional groups
Statistical analyses of multipopulation studies often use the data to select a particular population as the target of inference. For example, a confidence interval may be constructed for a population only in the event that its sample mean is larger than that of the other populations. We show that for the normal means model, confidence interval procedures that maintain strict coverage control conditional on such a selection event will have infinite expected width. For applications where such sel…

Discovering the $D_0^\ast(2100)$ in $B$ semileptonic decays
M. -L. Du, F. -K. Guo, C. Hanhart, F. Herren, B. Kubis, R. van Tonder
https://arxiv.org/abs/2509.12133 https://

Discovering the $D_0^\ast(2100)$ in $B$ semileptonic decays
The mass and width of the lightest scalar open-charm state listed in the Review of Particle Physics, the $D_0^\ast(2300)$, are in puzzling tension with predictions from unitarized chiral perturbation theory (UChPT) and lattice QCD, which favor a lighter state at around $2100$ MeV. However, to date, no direct experimental evidence for this lighter state exists. In an effort to facilitate a direct observation, we introduce angular asymmetries of $B\rightarrow D π\ell ν$ decays that allow for a …

Probing the spectral width of the 12.4-keV solid-state $^{45}$Sc isomeric resonance
Peifan Liu, Miriam Gerharz, Berit Marx-Glowna, Willi Hippler, Jan-Etienne Pudell, Alexey Zozulya, Brandon Stone, Deming Shu, Robert Loetzsch, Sakshath Sadashivaiah, Lars Bocklage, Christina Boemer, Shan Liu, Vitaly Kocharyan, Dietrich Krebs, Tianyun Long, Weilun Qin, Matthias Scholz, Kai Schlage, Ilya Sergeev, Hans-Christian Wille, Ulrike Boesenberg, Gianluca Aldo Geloni, J\"org Hallmann, Wonhyuk J…

Probing the spectral width of the 12.4-keV solid-state $^{45}$Sc isomeric resonance
The $^{45}$Sc nuclear transition from the ground to the isomeric state at 12.389~keV, with a lifetime of 0.46~s, exhibits an extraordinarily narrow natural width of 1.4~feV and a quality factor $\simeq 10^{19}$ -- surpassing those of the most precise atomic clocks -- making $^{45}$Sc a compelling platform for advanced metrology and nuclear clocks. Here we investigate how closely the spectral width and quality factor of the solid-state $^{45}$Sc resonance can approach these natural limits. Using…

This is probably important for #MastoDev folks: supporting full-width hash and at signs https://github.com/mastodon/mastodon/pull/36103
These signs: @ ＠ # ＃

Fix hashtags not being picked up when full-width hash sign is used by Gargron · Pull Request #36103 · mastodon/mastodon

I needed to replace* my lovely extra long yoga mat and I’ve been angry for a week that I can only buy longer mats (I’m 178 cm tall, most mats are about 180) that are also wider. My new cute blue mat got delivered today in time for my class and … actually it was great. The extra width means less shuffling between poses for long limbs.
* the top layer unstuck from the bottom layer and stuck to itself instead to create a sort of curly lettuce effect, after years of loyal service!

Durant une période, je récupérais tout ce que je pouvais.
Une tour comme serveur de fichier, une comme serveur web, même un serveur mail (ah la config de Sendmail ) et un dns. Et des nuits Š tenter de compiler un noyau.
Enfin, je ne sais pas pourquoi je raconte ça.
Bonne journée 👋

Normal subgroups of non-torsion multi-EGS groups
Benjamin Klopsch, Anitha Thillaisundaram
https://arxiv.org/abs/2509.08576 https://arxiv.org/pdf/2509.08576…

Normal subgroups of non-torsion multi-EGS groups
We study the distribution of normal subgroups in non-torsion, regular branch multi-EGS groups and show that the congruence completions of such groups have bounded finite central width. In particular, we show that the profinite completion of the Fabrykowski--Gupta group acting on the $p$-adic tree has central width 2 for every odd prime $p$. The methods used also apply to the family of Sunic groups, which closely resemble the Grigorchuk group.

SV-Mixer: Replacing the Transformer Encoder with Lightweight MLPs for Self-Supervised Model Compression in Speaker Verification
Jungwoo Heo, Hyun-seo Shin, Chan-yeong Lim, Kyo-won Koo, Seung-bin Kim, Jisoo Son, Ha-Jin Yu
https://arxiv.org/abs/2509.14136

SV-Mixer: Replacing the Transformer Encoder with Lightweight MLPs for Self-Supervised Model Compression in Speaker Verification
Self-supervised learning (SSL) has pushed speaker verification accuracy close to state-of-the-art levels, but the Transformer backbones used in most SSL encoders hinder on-device and real-time deployment. Prior compression work trims layer depth or width yet still inherits the quadratic cost of self-attention. We propose SV-Mixer, the first fully MLP-based student encoder for SSL distillation. SV-Mixer replaces Transformer with three lightweight modules: Multi-Scale Mixing for multi-resolution …

Which Solar Latitude Follows the Sunspot Cycle Exactly?
K P Raju
https://arxiv.org/abs/2509.09974 https://arxiv.org/pdf/2509.09974

Which Solar Latitude Follows the Sunspot Cycle Exactly?
The large-scale convection in the Sun known as supergranulation is manifested as a network structure on the solar surface. The network cells have an average lifetime of 24 hr, a size of about 30 Mm, and a lane width of about 6 Mm. We have obtained the lane widths and intensities at different latitudes from the Ca {\sc ii} K spectroheliograms from the 100 yr Kodaikanal archival data. We have then calculated the cross correlation function of lane widths and intensities with sunspot number at ever…

Asymptotic structure. III. Excluding a fat tree
Tung Nguyen, Alex Scott, Paul Seymour
https://arxiv.org/abs/2509.09035 https://arxiv.org/pdf/2509.09035

Asymptotic structure. III. Excluding a fat tree
Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every finite graph $G$ with an $H$ minor has path-width more than $k$. If we (twice) replace ``path-width'' by ``line-width'', the same is true for infinite graphs $G$. We prove a ``coarse graph theory'' analogue, as follows. For every finite tree $H$ and every $c…

Ancient Gauss Curvature Flows of Bounded Width
Beomjun Choi, Kyeongsu Choi, Dongjun Noh
https://arxiv.org/abs/2510.05614 https://arxiv.org/pdf/2510.05614…

Ancient Gauss Curvature Flows of Bounded Width
In this paper, we construct a pancake-like ancient compact solution with flat sides to the Gauss curvature flow, contained in a slab. Also, we construct sausage-like ancient compact solutions to the $α$-Gauss curvature flow with $α>\frac{1}{2}$, asymptotic to a round cylinder.

Quantifying topological features and irregularities in zebrafish patterns using the sweeping-plane filtration
Nour Khoudari, John Nardini, Alexandria Volkening
https://arxiv.org/abs/2509.11023

Quantifying topological features and irregularities in zebrafish patterns using the sweeping-plane filtration
Complex patterns emerge across a wide range of biological systems. While such patterns often exhibit remarkable robustness, variation and irregularity exist at multiple scales and can carry important information about the underlying agent interactions driving collective dynamics. Many methods for quantifying biological patterns focus on large-scale, characteristic features (such as stripe width or spot number), but questions remain on how to characterize messy patterns. In the case of cellular …

A New Population of Point-like, Narrow-line Objects Revealed by the James Webb Space Telescope
Haojing Yan (University of Missouri-Columbia), Bangzheng Sun (University of Missouri-Columbia), Riley Shive (University of Missouri-Columbia)
https://arxiv.org/abs/2509.12177

A New Population of Point-like, Narrow-line Objects Revealed by the James Webb Space Telescope
We report a new population of objects discovered using the data from the James Webb Space Telescope, which are characterized by their point-like morphology and narrow permitted emission lines. Our sample includes nine objects found in three JWST wide survey fields, which have z=3.624 to 5.378 and M_B ~ -18.3 to -21.4 mag. Their light distributions follow gaussian profiles, with the full-width-at-half-maximum (FWHM) values only 3.7%--34.6% larger than those of the point spread functions. Their s…

Scaling High-Performance Nanoribbon Transistors with Monolayer Transition Metal Dichalcogenides
Tara Pe\~na, Anton E. O. Persson, Andrey Krayev, \'Ashildur Fri{\dh}riksd\'ottir, Kathryn Neilson, Zhepeng Zhang, Anh Tuan Hoang, Jerry A. Yang, Lauren Hoang, Andrew J. Mannix, Paul C. McIntyre, Eric Pop
https://arxiv.org/abs/2509.09964

Scaling High-Performance Nanoribbon Transistors with Monolayer Transition Metal Dichalcogenides
Nanoscale transistors require aggressive reduction of all channel dimensions: length, width, and thickness. While monolayer two-dimensional semiconductors (2DS) offer ultimate thickness scaling, good performance has largely been achieved only in micrometer-wide channels. Here, we demonstrate both $\it{n}$- and $\it{p}$-type nanoribbon transistors based on monolayer 2DS, fabricated using a multi-patterning process, reaching channel widths down to 25 nm and lengths down to 50 nm. 'Anchored' conta…

Ukraine: Im August 60 Ziele in Russland angegriffen
Die Ukraine hat im August nach eigenen Angaben 60 Ziele auf russischem Territorium angegriffen. Das teilte der oberste Militärbefehlshaber der Ukraine, Oleksandr Syrskyi, in den sozialen Medien mit.
📷

An upper bound of the silhouette validation metric for clustering
Hugo Str\"ang, Tai Dinh
https://arxiv.org/abs/2509.08625 https://arxiv.org/pdf/2509.…

An upper bound of the silhouette validation metric for clustering
The silhouette coefficient summarizes, per observation, cohesion versus separation in [-1, 1]; the average silhouette width (ASW) is a common internal measure of clustering quality where higher values indicate more coveted results. However, the dataset-specific maximum of ASW is typically unknown, and the standard upper limit 1 is often unattainable. In this work, we derive for each data point in a given dataset a sharp upper bound on its silhouette width. By aggregating these individual bounds…

Danach dann wieder in den VIP-Bereich. Ein paar weitere Häppchen. Und statt Prosecco gab es anständigen Champagner. Aber nicht irgendeinen. Pavel Kasik, der Besitzer des Tatra 80 hat nämlich eine Magnumflasche mitgebracht, die er am Concours d'Elegance am Château Chantilly für seinen Sieg in der Kategorie beste Restaurierung bekommen hat, und die wollte er unbedingt mit uns teilen.

An arithmetic measure of width for convex bodies
Jes\'us A. De Loera, Brittney Marsters, Christopher O'Neill
https://arxiv.org/abs/2509.04726 https://

An arithmetic measure of width for convex bodies
We introduce the arithmetic width of a convex body, defined as the number of distinct values a linear functional attains on the lattice points within the body. Arithmetic width refines lattice width by detecting gaps in the lattice point distribution and always provides a natural lower bound. We show that for large dilates of a convex body, the attained values form an arithmetic progression with only a bounded number of omissions near the extremes. For rational polytopes, we show that the arith…

On the Hardness of Order Finding and Equivalence Testing for ROABPs
C. Ramya, Pratik Shastri
https://arxiv.org/abs/2509.13238 https://arxiv.org/pdf/2509.13…

On the Hardness of Order Finding and Equivalence Testing for ROABPs
The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide some evidence (based on the Small Set Expansion hypothesis) that it is also hard to approximate the optimal ROABP width. In another work, Baraskar et al. show that it is NP-hard to test whether a polynomial is in the $\mathrm{GL}_n$ orbit of a polynomial of spa…

Railroad tracks on Rt 38 south of Newark Valley -- so far as I know trains still deliver oil to a petroleum depot near Harford
#photo #photography #landscape

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
Colin Geniet, St\'ephan Thomass\'e

High Resolution ALMA Data of the Fomalhaut Debris Disk Confirms Apsidal Width Variation
Jay S. Chittidi (Department of Physics and Astronomy, John Hopkins University, Department of Astrophysical and Planetary Sciences, University of Colorado, Boulder), Meredith A. MacGregor (Department of Physics and Astronomy, John Hopkins University), Joshua Bennett Lovell (Center for Astrophysics, Harvard and Smithsonian), Gaspard Duchene (Astronomy Department, University of California, Berkeley, Un…

High Resolution ALMA Data of the Fomalhaut Debris Disk Confirms Apsidal Width Variation
We present long-baseline observations of the Fomalhaut outer debris disk at 223 GHz (1.3 mm) from ALMA Cycle 5, which we use along with archival short-baseline observations to produce a 0".57 resolution mosaic of the disk at a sensitivity of 7 $μ$Jy/bm. We use radial profiles to measure the disk at the ansae and find that the southeast (SE) side of the disk is 4 AU wider than the northwest (NW) side as observed by ALMA. We also find that the peak brightness of the NW ansa is $21\pm1\%$ brighte…

COMPACT: Common-token Optimized Model Pruning Across Channels and Tokens
Eugene Kwek, Wenpeng Yin
https://arxiv.org/abs/2509.06836 https://arxiv.org/pdf/25…

COMPACT: Common-token Optimized Model Pruning Across Channels and Tokens
Making LLMs more efficient in memory, latency, and serving cost is crucial for edge deployment, interactive applications, and sustainable inference at scale. Pruning is a key technique toward this goal. However, prior pruning methods are limited: width pruning often breaks the standard transformer layout or requires custom inference code, while depth pruning removes entire layers and can cause abrupt accuracy drops. In this work, we propose COMPACT, which jointly (i) prunes rare vocabulary to s…

En el pasado vivía en Offenbach, una ciudad alemana que prospera gracias a sus inmigrantes. Me encanta que todavía son muy fuerza contra la derecha
https://www.dw.com/es/cuán-seguras-están-las-mujeres-en-alemania/a-74578810?maca=spa-rss-sp-inter-1008-rdf

Oscillating ring ferrodark solitons with breathing nematic core in a homogeneous spinor superfluid
Xiaoquan Yu
https://arxiv.org/abs/2509.13874 https://arx…

Oscillating ring ferrodark solitons with breathing nematic core in a homogeneous spinor superfluid
We study the dynamics of ring ferrodark solitons (FDSs) in a homogeneous quasi-two-dimensional (2D) ferromagnetic spin-1 Bose-Einstein condensate (BEC). In contrast to the usual expanding dynamics of ring dark solitons in a homogeneous system, the ring FDS radius exhibits self-sustained oscillations accompanied by the nematic tensor breathing at the magnetization-vanishing ring FDS core. When the ring radius greatly exceeds the FDS width, motion is nearly elastic, and we derive the ring-radius …

Beyond scalar QED radiative corrections: the $\rho^{\pm}-\rho^0$ width difference, FSR corrections and their impact on $\Delta a_{\mu}^{\rm HVP, LO}[\tau]$
F. V. Flores-Baez, G. L\'opez Castro, Genaro Toledo
https://arxiv.org/abs/2510.02723

Beyond scalar QED radiative corrections: the $ρ^{\pm}-ρ^0$ width difference, FSR corrections and their impact on $Δa_μ^{\rm HVP, LO}[τ]$
In a previous paper arXiv:0708.3256 [hep-ph] we have calculated the radiative corrections to $ρ\to ππ$ decays, aiming to estimate the width difference between charged and neutral rho mesons. There, we have used the scalar QED approximation and taken the convection terms to keep the loop contributions finite in the case of charged rho meson decays. Here we compute the radiative corrections by considering the electromagnetic structure of charged mesons and we also include the full Lorentz stru…

Satirische Boomer Sharepics für den WA-Status im Familienchat.
https://www.reddit.com/r/minus600euro/

An investigation into the combined effect of steady and pulsatile flow within a wavy channel filled with an anisotropic porous medium
Sanchita Pramanik, Timir Karmakar
https://arxiv.org/abs/2510.08729 …

An investigation into the combined effect of steady and pulsatile flow within a wavy channel filled with an anisotropic porous medium
We provide an analytical solution to examine the impact of steady and pulsatile flow in a symmetric wavy channel filled with an anisotropic porous medium. The flow inside the wavy channel with a porous substrate is governed by the Darcy-Brinkman equation. We used the perturbation approach to ascertain the solution to the problem, assuming that the ratio between the channel width and the wavelength is very small (i.e., $δ^2 \ll 1$). We solved the problem up to $O(δ^2)$ by assuming $λ^2 δ^2 \…

13 Billion Years of MgII Absorber Evolution
Christopher W. Churchill (New Mexico State University), Asif Abbas (New Mexico State University), Glenn G. Kapcrzak (Swinburne University of Technology), Nikole M. Nielsen (Swinburne University of Technology, University of Oklahoma)
https://arxiv.org/abs/2510.01430

13 Billion Years of MgII Absorber Evolution
Applying "apportioned integrals," we use dN/dX measurements to determine the MgII absorber equivalent width distribution function for Wr > 0.03 [angstroms] and 0 < z < 7. Adopting a Schechter distribution, f(z,W)dW = Phi* (W/W*)^alpha e^{-W/W*} dW/W*, we present the normalization, Phi*(z), the characteristic equivalent width, W*(z), and the weak-end slope, alpha(z), as smooth functions of redshift. Measurements of dN/dX are robust for z < 4 but less so at z > 4 for weaker absorbers (Wr < 0.3 [a…

DuoServe-MoE: Dual-Phase Expert Prefetch and Cache Scheduling for Efficient MoE LLM Inference
Yuning Zhang, Grant Pinkert, Nan Yang, Yanli Li, Dong Yuan
https://arxiv.org/abs/2509.07379

DuoServe-MoE: Dual-Phase Expert Prefetch and Cache Scheduling for Efficient MoE LLM Inference
Large Language Models (LLMs) have demonstrated impressive performance across a wide range of deep learning tasks. Mixture of Experts (MoE) further enhances their capabilities by increasing model width through sparsely activated expert branches, which keeps inference computation efficient. However, the large number of expert weights introduces significant GPU memory pressure, especially in resource-constrained environments such as single-GPU servers. More importantly, MoE inference consists of t…

Dimensionality reduction and width of deep neural networks based on topological degree theory
Xiao-Song Yang
https://arxiv.org/abs/2511.06821 https://arxiv.org/pdf/2511.06821 https://arxiv.org/html/2511.06821
arXiv:2511.06821v1 Announce Type: new
Abstract: In this paper we present a mathematical framework on linking of embeddings of compact topological spaces into Euclidean spaces and separability of linked embeddings under a specific class of dimension reduction maps. As applications of the established theory, we provide some fascinating insights into classification and approximation problems in deep learning theory in the setting of deep neural networks.
toXiv_bot_toot

Status of the PrimEx $\eta$ experiment at Jefferson Lab
Alexander Somov
https://arxiv.org/abs/2510.04324 https://arxiv.org/pdf/2510.04324

Status of the PrimEx $η$ experiment at Jefferson Lab
The GlueX detector in the experimental Hall $D$ at Jefferson Lab offers a unique opportunity to perform a measurement of the decay width of eta mesons through the Primakoff effect. The PrimEx $η$ experiment complements the physics program at Jefferson Lab on measuring the decay width of light pseudoscalar mesons via the Primakoff process. The goal of PrimEx $η$ is to measure differential cross sections of $η$ mesons at forward angles using a beam of tagged photons incident on a liquid ${}^{4…

Jebus! #Affinity

Il aura fallu attendre 1997 pour que je remette les mains dans l'informatique.
Evidemment windows, je me suis très vite senti conçé et je suis tombé sur une revue qui parlait de Linux, avec un CD debian.
Depuis, je n'ai pas lâcher et toujours du plaisir Š bricoler.

A recursive approach for the determination of the nice sections of width three having a 4-crown stack as retract
Frank a Campo
https://arxiv.org/abs/2510.05640 https://

A recursive approach for the determination of the nice sections of width three having a 4-crown stack as retract
The characterization of the finite minimal automorphic posets of width three is still an open problem. Niederle has shown that this task can be reduced to the characterization of the nice sections of width three having a non-trivial tower of nice sections as retract. In our article, we characterize those of them which have a 4-crown stack as retract and we develop a recursive approach for their determination. We apply the approach on a sub-class $\mathfrak{N}_2$ of nice sections of width three …

Pixie would like to know why the lunch that has already been eaten is the only lunch that will be offered. #CatsOfMastodon

I don’t suppose there are any Wii Fit U mods that bring back the missing minigames from Wii Fit Plus right?
I guess they chose only the ones they thought were the best ones to bring back which is fair enough I guess, but some of the ones I like are missing
I’d be very cool if they kept everything from Wii Fit Plus, PLUS the new ones in U
(don’t really wanna get plus on wii mode bc then it’ll be two separate games and leaderboards and stuff, and then I probably won’t want to switch between both modes during a playtime and also I’d probably forget to switch for minigames that are available in both places)
#WiiU

Supra-arcade downflows in an extensive fan associated with a giant quiescent solar filament eruption
Xiaoyan Xie, Katharine Reeves, Chengcai Shen, Nishu Karna, Yan Xu, Christopher Moore, Crisel Suarez, Ritesh Patel, Daniel Seaton
https://arxiv.org/abs/2509.09944

Supra-arcade downflows in an extensive fan associated with a giant quiescent solar filament eruption
We investigate the aftermath of a giant quiescent solar filament eruption on December 24, 2023. One feature of the eruption is an extensive fan above the filament channel that is about three times as wide as similar structures that appear above active regions (ARs) during solar flares. The fan contains numerous supra-arcade downflows (SADs), and we investigate the largest SADs with continuous Hinode X-ray Telescope (XRT) observations. The measured maximum width of the SADs in this event is at l…

I think I'm making progress on the bottom-of-column logic.
I've traced out a bunch, but I don't grok.
There's a bunch of control signals running the full height from bottom to top which makes tracing stuff out a bit painful.
The circuit that I thought was the column mux itself seems straightforward, just eight pass transistors that connect the drain-side bitlines to a common 8-bit bus on metal 2 running the full width of the array.
But then there's…

Hong-Ou-Mandel interferometry for fractional excitations: Unified framework and dip width scaling
Aleksander Latyshev, Imen Taktak, Ipsita Mandal, Ines Safi
https://arxiv.org/abs/2509.07875

Hong-Ou-Mandel interferometry for fractional excitations: Unified framework and dip width scaling
Extending Hong--Ou--Mandel (HOM) interferometry to the fractional quantum Hall effect (FQHE) promises direct access to anyonic statistics, yet remains challenging: on-demand anyon injection is hindered by integer-charged minimal excitations, and recent HOM experiments in the FQHE lack a fully consistent theoretical framework. Here we provide a general theory of time-resolved HOM interferometry in quantum Hall systems. Combining the nonequilibrium bosonized edge theory (NEBET) with the unifying …

Asymptotic structure. II. Path-width and additive quasi-isometry
Tung Nguyen, Alex Scott, Paul Seymour
https://arxiv.org/abs/2509.09031 https://arxiv.org/p…

Asymptotic structure. II. Path-width and additive quasi-isometry
We show that if a graph $G$ admits a quasi-isometry $ϕ$ to a graph $H$ of bounded path-width, then we can assign a non-negative integer length to each edge of $H$, such that the same function $ϕ$ is a quasi-isometry to this weighted version of $H$, with error only an additive constant.

On-chip amplification-free fCEO detection and broadband SCG in parabolically width-modulated TFLN waveguides
Tianyou Tang, Simin Yu, Ruixin Zhou, Jianing Zhang, Juanjuan Lu, Guanyu Chen, Tao Zhu, Lingfang Wang
https://arxiv.org/abs/2509.00394

On-chip amplification-free fCEO detection and broadband SCG in parabolically width-modulated TFLN waveguides
We demonstrate amplification-free carrier-envelope offset (fCEO) detection in parabolically width-modulated z-cut thin-film lithium niobate (TFLN) waveguide that simultaneously engineers dispersion and enhances nonlinear interactions. With 116 fs pulses at 1560 nm, the device generates more than two octaves broadband SCG spanning 600 to beyond 2400 nm, enabling spectral overlap between dispersive waves and second-harmonic generation near 780 nm for robust f-2f self-referencing. Most notably, we…

Practical security of local local oscillator continuous-variable quantum key distribution systems with pulse width mismatch
Yi Zheng, Jiarui Wu, Chenlei Fang, Qingbing Ji, Wei Pan, Haobin Shi
https://arxiv.org/abs/2509.26021

Practical security of local local oscillator continuous-variable quantum key distribution systems with pulse width mismatch
In continuous-variable quantum key distribution (CVQKD) systems, using a local local oscillator (LLO) scheme removes the local oscillator side channel, enhances Bob's detection performance and reduces the excess noise caused by photon leakage, thereby effectively improves the system's security and performance. However, in this scheme, since the signal and the LO are generated by different lasers and the signal propagates through the untrusted quantum channel, their pulse widths may become misma…

nini, fedi!

Mon premier ordinateur : https://fr.wikipedia.org/wiki/TRS-80
Je me souviens qu'on me l'avais donné. J'avais cherché Š comprendre qu'est-ce que je pourrais faire avec ce truc et comment. Puis un jour, plus rien ne fonctionnait. Jamais compris pourquoi jusqu'Š aujourd'hui, grâce Š cette page wikipedia.
"La plupart de ces systèmes n'étaient pas compatibles avec le passage de l'an 1988."
J'ai été victime du bug de l'an 1988

Quantitative convergence of trained single layer neural networks to Gaussian processes
Eloy Mosig, Andrea Agazzi, Dario Trevisan
https://arxiv.org/abs/2509.24544 https://…

Quantitative convergence of trained single layer neural networks to Gaussian processes
In this paper, we study the quantitative convergence of shallow neural networks trained via gradient descent to their associated Gaussian processes in the infinite-width limit. While previous work has established qualitative convergence under broad settings, precise, finite-width estimates remain limited, particularly during training. We provide explicit upper bounds on the quadratic Wasserstein distance between the network output and its Gaussian approximation at any training time $t \ge 0…

Brand durch Angriffe auf Odessa
Behörden zufolge hat Russland die ukrainische Stadt Odessa in der Nacht erneut mit Drohnen attackiert. Verletzt worden sei niemand, jedoch sei ein Lagerhaus in Brand geraten. Etwa 40 Einsatzkräfte der Feuerwehr rückten aus, um den Brand zu bekämpfen.
📷

Bisection width, max-cut and internal partitions of 5-regular graphs
Endre Cs\'oka, Panna T\'imea Fekete, Zolt\'an L\'or\'ant Nagy, Levente Szemer\'edi
https://arxiv.org/abs/2509.08531

Bisection width, max-cut and internal partitions of 5-regular graphs
In this paper, we present a new factor of IID process based on the local algorithm introduced by Díaz, Serna, and Wormald (2007). This new approach allows us to improve the previously known upper bounds on the minimum and maximum bisection width and the maximum cut of random d-regular graphs for d > 4 by introducing a new recoloring phase after the termination of the original algorithm. As an application, we show that random 5-regular graphs asymptotically almost surely admit an internal parti…

So, the annual evaluation only covers my performance on 06/30/2025?

The Ports of New York Winery looks like it was part of the set for a cowboy movie
#photo #photography #buildings #ithaca

Laser-drive droplet deformation at low Weber numbers
M. Kharbedia, H. Franca, H. K. Schuber, D. J. Engels, M. Jalaal, O. O. Versolato
https://arxiv.org/abs/2509.01495 https://…

Laser-drive droplet deformation at low Weber numbers
We investigate droplet deformation following laser-pulse impact at low Weber numbers (We ~ 0.1-100). Droplet dynamics can be characterized by two key parameters: the impact We number and the width, W, of the distribution of the impact force over the droplet surface. By varying laser pulse energy, our experiments traverse a phase space comprising (I) droplet oscillation, (II) breakup, or (III) sheet formation. Numerical simulations complement the experiments by determining the pressure width and…

First-principles response simulation of wide-gap CdTe-DSDs for the FOXSI solar sounding rocket experiment
Shunsaku Nagasawa, Takahiro Minami, Tadayuki Takahashi, Shin Watanabe
https://arxiv.org/abs/2509.00738

First-principles response simulation of wide-gap CdTe-DSDs for the FOXSI solar sounding rocket experiment
We have developed a wide-gap CdTe double-sided strip detector (CdTe-DSD) for the fourth and fifth flights of the Focusing Optics X-ray Solar Imager sounding rocket experiment (FOXSI-4/FOXSI-5). This detector features a 30 um strip width and a variable gap width from 30 um to 70 um, enabling position resolution finer than the strip pitch by inducing charge sharing across adjacent strip electrodes and utilizing this shared energy information for position reconstruction. However, this wide-gap con…

Non-Hermitian quantum geometric tensor and nonlinear electrical response
Kai Chen, Jie Zhu
https://arxiv.org/abs/2509.11765 https://arxiv.org/pdf/2509.1176…

Non-Hermitian quantum geometric tensor and nonlinear electrical response
We demonstrate that the non-Hermitian quantum geometric tensor (QGT) governs nonlinear electrical responses in systems with a spectral line gap. The quantum metric, which is a component of the QGT and takes complex values in non-Hermitian systems, generates an intrinsic nonlinear conductivity independent of the scattering time, while the complex Berry curvature induces a wavepacket-width-dependent response. Using one-dimensional and two-dimensional non-Hermitian models, we establish a universal…

Observational study of chromospheric jets in and around a sunspot observed by NVST and SDO
Guotang Wu, Xiaoli Yan, Zhike Xue, Jincheng Wang, Zhe Xu, Liheng Yang, Yian Zhou, Liping Yang, Xinsheng Zhang, Qifan Dong, Zongyin Wu
https://arxiv.org/abs/2510.11404

Observational study of chromospheric jets in and around a sunspot observed by NVST and SDO
To better understand the characteristics, driving mechanisms, and potential heating contributions of chromospheric jets, we analyze two contrasting types: one originating from within the sunspot penumbra (inside jets), and the other originating from outside the penumbra (outside jets). Statistical analysis of 100 jets (50 inside jets and 50 outside jets) reveals that inside jets have a projected velocity range of 4--14~km\,s$^{-1}$, a length range of 1--4~Mm, a width range of 0.2--0.6~Mm, and a…

An in-depth look at approximation via deep and narrow neural networks
Joris Dommel, Sven A. Wegner
https://arxiv.org/abs/2510.07202 https://arxiv.org/pdf/2…

An in-depth look at approximation via deep and narrow neural networks
In 2017, Hanin and Sellke showed that the class of arbitrarily deep, real-valued, feed-forward and ReLU-activated networks of width w forms a dense subset of the space of continuous functions on R^n, with respect to the topology of uniform convergence on compact sets, if and only if w>n holds. To show the necessity, a concrete counterexample function f:R^n->R was used. In this note we actually approximate this very f by neural networks in the two cases w=n and w=n+1 around the aforementioned th…

Tree decompositions with small width, spread, order and degree
David R. Wood
https://arxiv.org/abs/2509.01140 https://arxiv.org/pdf/2509.01140

Tree decompositions with small width, spread, order and degree
Tree-decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. The main property of tree-decompositions is the width (the maximum size of a bag $-1$). We show that every graph has a tree-decomposition with near-optimal width, plus several additional properties of interest. In particular every graph $G$ with treewidth at most $k$ has a tree-decomposition with width at most $72k+1$, where each vertex $v$ appears in at most $\text{deg}_G(v)+1$ bags, the num…

Französischer Außenminister im Élysée-Palast eingetroffen
Der französische Außenminister Jean-Noël Barrot ist bereits im Élysée-Palast eingetroffen, wo später die Beratungen von etwa 30 Staats- und Regierungschefs über weitere Hilfen und Sicherheitsgarantien für die Ukraine beginnen sollen.
📷

Other girls on fedi are so smart

Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources
Brent Harrison, Vishnu Iyer, Ojas Parekh, Kevin Thompson, Andrew Zhao
https://arxiv.org/abs/2510.05557

Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources
Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation. Any such universal family must have unbounded entanglement width, which is known to be equivalent to the ability to produce any circle graph state from the states in the family using only local Clifford operations, local Pauli measurements, and classical communication. Yet, i…

Line-width and path-width
Tung Nguyen, Alex Scott, Paul Seymour
https://arxiv.org/abs/2509.16786 https://arxiv.org/pdf/2509.16786

Line-width and path-width
For finite graphs, path-width is an interesting and useful concept, but if we extend it to infinite graphs in the most obvious way (by making the indexing path infinite), it does not work nicely. The simplest extension that works nicely is to allow the indexing set to be any totally-ordered set, and then the corresponding decomposition is called a ``line-decomposition'', and the maximum bag size needed is called ``line-width''. In particular, the indexing set need not be a well-order; but the…

Spooky season!!

Scaling of Magnetic Domain Walls in Perpendicular Magnetic Anisotropy Systems
Guowen Gong, Changmin Xiong, Lijun Zhu
https://arxiv.org/abs/2510.10230 https://

Scaling of Magnetic Domain Walls in Perpendicular Magnetic Anisotropy Systems
Magnetic domain walls play a critical role in the nanoscale evolution of magnetic devices. Despite the early efforts, a complete understanding of the micromagnetic evolution of the width and the type of magnetic domain walls has still remained missing. Here, we report a combined analytical and micromagnetic simulation study and establish the scaling of the magnetic domains as a function of the exchange stiffness (A), uniaxial perpendicular magnetic anisotropy (Ku), saturation magnetization (Ms)…

Angriff auch auf Kiew
Nach Angaben des ukrainischen Militärs hat die Ukraine auch einen russischen Luftangriff auf die Hauptstadt Kiew abgewehrt. "Die Luftabwehr ist in Kiew im Einsatz! Bleiben Sie in den Schutzräumen, bis Entwarnung gegeben wird!", teilte Timur Tkachenko, Leiter der Militärverwaltung von Kiew, bei Telegram mit.
📷

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
Tung Nguyen, Alex Scott, Paul Seymour
https://arxiv.org/abs/2509.08762 https://…

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want the paths to be far apart, say at distance at least $c$? One might hope that we can find either $k+1$ paths pairwise far apart, or $k$ sets of bounded radius that separate $S$ and $T$, where the bound on the radius is some $\ell$ that depends only on $k,c$ (t…

It would be so cool to live on the sea

Cube Height, Cube Width and Related Extremal Problems for Posets
Paul Bastide, J\k{e}drzej Hodor, Hoang La, William T. Trotter
https://arxiv.org/abs/2510.00928 https://

Cube Height, Cube Width and Related Extremal Problems for Posets
Given a poset $P$, a family $\mathcal{S}=\{S_x:x\in P\}$ of sets indexed by the elements of $P$ is called an inclusion representation of $P$ if $x\leqslant y$ in $P$ if and only if $S_x\subseteq S_y$. The cube height of a poset is the least non-negative integer $h$ such that $P$ has an inclusion representation for which every set has size at most $h$. In turn, the cube width of $P$ is the least non-negative integer $w$ for which there is an inclusion representation $\mathcal{S}$ of $P$ such tha…

What I can’t be the only one who says “tee-teye”??

Arithmetic Y-frieze patterns of width 3 and 4
Katsuhiko Matsuzaki, Taiki Resnick
https://arxiv.org/abs/2508.15330 https://arxiv.org/pdf/2508.15330

Arithmetic Y-frieze patterns of width 3 and 4
We determine all arithmetic Y-Frieze patterns of width $3$ and $4$. As a consequence, for $n=3,4$, we verify the surjectivity of a map $p_n$ which corresponds arithmetic Y-Frieze patterns of width $n$ to Coxeter's Frieze patterns.

On the chromatic number of random triangle-free graphs
Clayton Mizgerd, Will Perkins, Yuzhou Wang
https://arxiv.org/abs/2509.01376 https://arxiv.org/pdf/25…

On the chromatic number of random triangle-free graphs
We study the chromatic number of typical triangle-free graphs with $Θ\left( n^{3/2} (\log n)^{1/2} \right)$ edges and establish the width of the scaling window for the transitions from $χ= 3$ to $χ= 4$ and from $χ= 4$ to $χ= 5$. The transition from $3$- to $4$-colorability has scaling window of width $Θ(n^{4/3} (\log n)^{-1/3})$. To prove this, we show a high probability equivalence of the $3$-colorability of a random triangle-free graph at this density and the satisfiability of an inst…

On the construction of frieze patterns from partitions of convex polygons by nonintersecting diagonals
Yury Kochetkov
https://arxiv.org/abs/2509.07600 https://

On the construction of frieze patterns from partitions of convex polygons by nonintersecting diagonals
We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.