Tootfinder

Origin of Superconductivity in Rhombohedral Trilayer Graphene: Quasiparticle Pairing within the Inter-Valley Coherent Phase
Chun Wang Chau, Shuai A. Chen, K. T. Law
https://arxiv.org/abs/2404.19237 https://arxiv.org/pdf/2404.19237
arXiv:2404.19237v1 Announce Type: new
Abstract: Superconductivity (SC) is observed in rhombohedral trilayer graphene (RTG) with an extremely low charge carrier densities, between the normal metal state and a probable inter-valley coherent (IVC) state. The measured coherence length in RTG is roughly two orders of magnitude shorter than the value predicted by a conventional BCS theory. To resolve these discrepancies, we propose that the RTG SC phase arises from the pairing of quasiparticles within the IVC phase. We illustrate the SC behavior using gapped Dirac cones with the chemical potential close to the conduction band's bottom and establish the Ginzburg-Landau theory. Our findings indicate that the mean-field transition temperature, $T_\mathrm{MF}$, is primarily determined by the density of states of quasiparticles within the IVC phase, and is more suppressed in comparison with the BCS relation. Interestingly, we discover that the coherence length behaves according to $\xi\sim 1/\sqrt{T_\mathrm{MF}}$. When the chemical potential lies within the band gap, the conventional coherence length becomes small, while the quantum metric contribution can diverge. Applying our approach to a microscopic model for RTG, our predictions align well with experimental data and effectively capture key measurable features of quantities such as the mean-field transition temperature $T_\mathrm{MF}$ and the coherence length $\xi$. Furthermore, we reveal that the quantum metric contribution, stemming from the multi-band properties of the IVC quasiparticles, plays a significant role in determining the coherence length around the transition regime from superconductivity to IVC. Lastly, experimental predictions are discussed on bebaviors of the upper critical field and coherence length at low temperatures.

On the maximum size of variable-length non-overlapping codes
Geyang Wang, Qi Wang
https://arxiv.org/abs/2402.18896 https://arxiv.org/…

On the maximum size of variable-length non-overlapping codes
Non-overlapping codes are a set of codewords such that the prefix of each codeword is not a suffix of any codeword in the set, including itself. If the lengths of the codewords are variable, it is additionally required that every codeword is not contained in any other codeword as a subword. Let $C(n,q)$ be the maximum size of $q$-ary fixed-length non-overlapping codes of length $n$. The upper bound on $C(n,q)$ has been well studied. However, the nontrivial upper bound on the maximum size of var…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 112890 edges.
Tags: Biol…

Extending Llama-3's Context Ten-Fold Overnight
Peitian Zhang, Ninglu Shao, Zheng Liu, Shitao Xiao, Hongjin Qian, Qiwei Ye, Zhicheng Dou
https://arxiv.org/abs/2404.19553 https://arxiv.org/pdf/2404.19553
arXiv:2404.19553v1 Announce Type: new
Abstract: We extend the context length of Llama-3-8B-Instruct from 8K to 80K via QLoRA fine-tuning. The entire training cycle is super efficient, which takes 8 hours on one 8xA800 (80G) GPU machine. The resulted model exhibits superior performances across a broad range of evaluation tasks, such as NIHS, topic retrieval, and long-context language understanding; meanwhile, it also well preserves the original capability over short contexts. The dramatic context extension is mainly attributed to merely 3.5K synthetic training samples generated by GPT-4 , which indicates the LLMs' inherent (yet largely underestimated) potential to extend its original context length. In fact, the context length could be extended far beyond 80K with more computation resources. Therefore, the team will publicly release the entire resources (including data, model, data generation pipeline, training code) so as to facilitate the future research from the community: \url{https://github.com/FlagOpen/FlagEmbedding}.

I am genuinely curious what this obviously Engrish translation intended by "Foreign minister". (Found on Amazon, of course.)

There must be replacement of people in trenches – servicemen’s families The non-inclusion of the demobilization provision in the new law on mobilization forced the Association of Servicemen’s Families Source : https://uacrisis.org/en/lyudej-v-okopah-treb…

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

How to Find Long Maximal Exact Matches and Ignore Short Ones
Finding maximal exact matches (MEMs) between strings is an important task in bioinformatics, but it is becoming increasingly challenging as geneticists switch to pangenomic references. Fortunately, we are usually interested only in the relatively few MEMs that are longer than we would expect by chance. In this paper we show that under reasonable assumptions we can find all MEMs of length at least $L$ between a pattern of length $m$ and a text of length $n$ in $O (m)$ time plus extra $O (\log n)…

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

On the Symbol Length of Fields with finite Square Class Number
Let $F$ be a field of characteristic not $2$ with finitely many square classes. Using combinatorial arguments applied to objects related to vector spaces over finite fields, we deduce an upper bound for the number of Pfister forms over $F$. Moreover, we compute upper bounds for the $n$-symbol length $F$ ($n\in\mathbb N$), i.e., the smallest integer $\mathrm{sl}_n(F)\geq 0$ such that to each quadratic form $ϕ\in \mathsf I^n(F)$ there exists some $0\leq k\leq \mathrm{sl}_n(F)$ and Pfister forms …

Last week I was walking along and I noticed that my shadow was quite long. I took a photo and you can just make out the "head".
A rough estimate from the length of the buildings indicates that the shadow is about 70m (230 feet) in length.
#Iceland #Reykjavík

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

Long Plane Trees
In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more than two decades of research, it remains open whether this problem is NP-hard. Thus, previous efforts have focused on olynomial-time algorithms that produce plane trees whose total edge length approximates $\text{OPT}$, the maximum possible length. The approxima…

In Theodorus' Spiral no two hypothenusa lie on the same line
Frederik Stouten
https://arxiv.org/abs/2403.20207 https://arxiv.org/…

In Theodorus' Spiral no two hypothenusa lie on the same line
Consider the rectangular triangle with sides with length 1 and 1, then the oblique side has length square root of 2. Now construct on top of the oblique side, a new rectangular triangle with the oblique side as rectangle side and a second rectangle side of length 1. Continue this process indefinitely, what you get is called "the spiral of Theodorus". Now the question is: Can there be two hypothenusa (oblique sides) which lie on the same line? Apparently there can't. A proof of this proposition …

Weekend #Plankton #Factoid 🦐🦠
Holopedium spp. is a strange cladoceran #zooplankton in lakes. They create a large gelatinous polysaccharide mantle ~2x their body length, which helps with buoyancy and…

Calcium loss turning lakes to 'jelly'
New research on a number of Canadian lakes show that historical acid deposits as a result of industry have greatly reduced calcium levels in the water - dramatically impacting populations of calcium-rich plankton such as Daphnia water fleas that dominate these ecosystems.

If you're not reading @… in his free daily Bloomberg finance column, you really should be. And if you're not reading Francine McKenna of The Dig, you should be as well. #Fraudwatch
Here they are together: she's citing him at length. Good …

The Dig | Francine McKenna | Substack
Francine McKenna digs into accounting, audit, and corporate governance issues at public and pre-IPO companies. Click to read The Dig, by Francine McKenna, a Substack publication with thousands of subscribers.

Transfer a full length movie in less than 40 seconds¹
¹ as long as that movie's filesize is 40MB

Growth in products of matrices: fastest, average, and generic
Vladimir Shpilrain
https://arxiv.org/abs/2405.00610 https://arxiv.org/p…

Growth in products of matrices: fastest, average, and generic
The problems that we consider in this paper are as follows. Let A and B be 2x2 matrices (over reals). Let w(A, B) be a word of length n. After evaluating w(A, B) as a product of matrices, we get a 2x2 matrix, call it W. What is the largest (by the absolute value) possible entry of W, over all w(A, B) of length n, as a function of n? What is the expected absolute value of the largest (by the absolute value) entry in a random product of n matrices, where each matrix is A or B with probability 0.5…

I recall once being upset when a journal editor told me the length of my title needed to be cut in half if not by two-thirds. "But that's absurd! This is how everyone writes titles!," I wanted to shout. Now that it's almost time for me to take over editing the very same journal, I can only agree with my predecessor. Your article can be 10,000 words in length - ideally, your title should be shorter than that.

How Does Conversation Length Impact User's Satisfaction? A Case Study of Length-Controlled Conversations with LLM-Powered Chatbots
Shih-Hong Huang, Ya-Fang Lin, Zeyu He, Chieh-Yang Huang, Ting-Hao 'Kenneth' Huang
https://arxiv.org/abs/2404.17025

How Does Conversation Length Impact User's Satisfaction? A Case Study of Length-Controlled Conversations with LLM-Powered Chatbots
Users can discuss a wide range of topics with large language models (LLMs), but they do not always prefer solving problems or getting information through lengthy conversations. This raises an intriguing HCI question: How does instructing LLMs to engage in longer or shorter conversations affect conversation quality? In this paper, we developed two Slack chatbots using GPT-4 with the ability to vary conversation lengths and conducted a user study. Participants asked the chatbots both highly and l…

Length of regular framed bicategories
Juan Orendain
https://arxiv.org/abs/2402.16296 https://arxiv.org/pdf/2402.16296

Length of regular framed bicategories
We consider framed bicategories for which horizontal identity squares are Cartesian. We call double categories satisfying this condition regular framed bicategories. The length of a double category is a numerical invariant measuring the work it takes to reconstruct the double category from its globular data. It is conjectured that framed bicategories are of length 1. In this paper we prove this conjecture for the case of regular framed bicategories.

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

Length 3 Check Digit Codes with Grouped Tags and Disjoint Coding Applications
In 1969 J. Verhoeff provided the first examples of a decimal error detecting code using a single check digit to provide protection against all single, transposition, and adjacent twin errors. The three codes he presented are length 3-digit codes with 2 information digits. To date, the existence of a length 4-digit code with 3 information digits having these properties remains an open question. Existence of a 4-digit code would imply the existence of 10 disjoint 3-digit codes. Apparently, no pai…

Length and torsion dependence of thermal conductivity in twisted graphene nanoribbons
Alexandre F. Fonseca, Luiz Felipe C. Pereira
https://arxiv.org/abs/2404.19262

Length and torsion dependence of thermal conductivity in twisted graphene nanoribbons
Research on the physical properties of materials at the nanoscale is crucial for the development of breakthrough nanotechnologies. One of the key properties to consider is the ability to conduct heat, i.e., its thermal conductivity. Graphene is a remarkable nanostructure with exceptional physical properties, including one of the highest thermal conductivities (TC) ever measured. Graphene nanoribbons (GNRs) share most fundamental properties with graphene, with the added benefit of having a contr…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 112890 edges.
Tags: Biol…

All-optical blast wave control of laser wakefield acceleration in near critical plasma
I. Tsymbalov, D. Gorlova, K. Ivanov, E. Starodubtseva, R. Volkov, I. Tsygvintsev, Yu. Kochetkov, Ph. Korneev, A. Polonski, A. Savelev
https://arxiv.org/abs/2403.19828

All-optical blast wave control of laser wakefield acceleration in near critical plasma
We propose a novel method for changing the length of laser wakefield electron acceleration in a gas jet by a cylindrical blast wave created by a perpendicularly focused nanosecond laser pulse. The shock front destroys the wake thus stopping interaction between the laser pulse and accelerated electron bunch allowing one to directly control the interaction length and avoid dephasing. It also improves the electron beam quality through the plasma lensing effect between the two shock fronts. We demo…

Flexible multi-bunch-length operation for continuous-wave x-ray free-electron lasers
Zihan Zhu, Jiawei Yan, Hanxiang Yang, Duan Gu, Bart Faatz, Haixiao Deng, Qiang Gu
https://arxiv.org/abs/2405.00245

Flexible multi-bunch-length operation for continuous-wave x-ray free-electron lasers
The X-ray free-electron lasers (XFELs) are cutting-edge instruments pivotal in a broad range of fields, providing high-power X-ray pulses with durations spanning from femtoseconds to attoseconds. One of the critical challenges in XFEL facilities is the simultaneous accommodation of diverse requirements for XFEL operation modes and photon properties across different undulator lines. This paper proposes a dipole-kicker combination in the bunch compressors to vary the electron bunch length for the…

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

On the number of subsequence sums of a sequence in finite abelian groups related to the support of the sequence
Let $G$ be a finite abelian group and $S$ a sequence with elements of $G$. Let $|S|$ denote the length of $S$ and $k$ an integer with $k\in [1, |S|]$. Let $Σ_{k}(S) \subset G$ denote the set of group elements which can be expressed as a sum of a subsequence of $S$ with length $k$. Let $Σ(S)=\cup_{k=1}^{|S|}Σ_{k}(S)$ and $Σ_{\geq k}(S)=\cup_{t=k}^{|S|}Σ_{t}(S)$. It is known that if $0\not\in Σ(S)$, then $|Σ(S)|\geq |S|+|\mat…

HiRoPE: Length Extrapolation for Code Models
Kechi Zhang, Ge Li, Huangzhao Zhang, Zhi Jin
https://arxiv.org/abs/2403.19115 https://ar…

HiRoPE: Length Extrapolation for Code Models
Addressing the limitation of context length in large language models for code-related tasks is the primary focus of this paper. Existing LLMs are constrained by their pre-trained context lengths, leading to performance issues in handling long complex code sequences. Inspired by how human programmers navigate code, we introduce Hierarchical Rotary Position Embedding (HiRoPE), a novel approach that enhances the traditional rotary position embedding into a hierarchical format based on the hierarch…

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

Probabilistic automatic complexity of finite strings
We introduce a new complexity measure for finite strings using probabilistic finite-state automata (PFAs), in the same spirit as existing notions employing DFAs and NFAs, and explore its properties. The PFA complexity $A_P(x)$ is the least number of states of a PFA for which $x$ is the most likely string of its length to be accepted. The variant $A_{P,δ}(x)$ adds a real-valued parameter $δ$ specifying a lower bound on the gap in acceptance probabilities between $x$ and other strings. We relat…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 112890 edges.
Tags: Biol…

Unruh effect using Doppler shift method in DSR framework
Vishnu Rajagopal
https://arxiv.org/abs/2403.20146 https://arxiv.org/pdf/2403…

Unruh effect using Doppler shift method in DSR framework
We study the Unruh effect in doubly special relativity (DSR) framework by generalising the Doppler-shift method to DSR. For both the scalar and Dirac particles, we observe a deviation in the power spectrum of Unruh radiation from the standard Bose-Einstein and Fermi-Dirac distributions, respectively, due to the presence of the frame independent length scale of DSR. We further show that this deviation results in the modification of Unruh temperature which then depends non-linearly on the proper …

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

Model-Free Change Point Detection for Mixing Processes
This paper considers the change point detection problem under dependent samples. In particular, we provide performance guarantees for the MMD-CUSUM test under exponentially $α$, $β$, and fast $ϕ$-mixing processes, which significantly expands its utility beyond the i.i.d. and Markovian cases used in previous studies. We obtain lower bounds for average-run-length (ARL) and upper bounds for average-detection-delay (ADD) in terms of the threshold parameter. We show that the MMD-CUSUM test enjoys…

Indoor Synthetic Aperture Radar Measurements of Point-Like Targets Using a Wheeled Mobile Robot
Yuma E. Ritterbusch, Johannes Fink, Christian Waldschmidt
https://arxiv.org/abs/2405.00121

Indoor Synthetic Aperture Radar Measurements of Point-Like Targets Using a Wheeled Mobile Robot
Small, low-cost radar sensors offer a lighting independent sensing capability for indoor mobile robots that is useful for localization and mapping. Synthetic aperture radar (SAR) offers an attractive way to increase the angular resolution of small radar sensors for use on mobile robots to generate high-resolution maps of the indoor environment. This work quantifies the maximum synthesizable aperture length of our mobile robot measurement setup using radar-inertial odometry localization and offe…

Towards the boundary of the fine curve graph
Jonathan Bowden, Sebastian Hensel, Richard Webb
https://arxiv.org/abs/2402.18948 https://

Towards the boundary of the fine curve graph
The fine curve graph was introduced as a geometric tool to study the homeomorphisms of surfaces. In this paper we study the Gromov boundary of this space and the local topology near points associated with minimal measurable foliations. We then give several applications including finding explicit elements with positive stable commutator length, and proving a Tits alternative for subgroups of $\textrm{Homeo}(S)$ containing a pseudo-Anosov map, generalizing a result of Hurtado-Xue.

Survey of Magnetic Field Parameters Associated With Large Solar Flares
Ting Li, Yanfang Zheng, Xuefeng Li, Yijun Hou, Xuebao Li, Yining Zhang, Anqin Chen
https://arxiv.org/abs/2402.18890

Survey of Magnetic Field Parameters Associated With Large Solar Flares
Until now, how the magnetic fields in M/X-class flaring active regions (ARs) differ from C-class flaring ARs remains unclear. Here, we calculate the key magnetic field parameters within the area of high photospheric free energy density (HED region) for 323 ARs (217 C- and 106 M$/$X-flaring ARs), including total photospheric free magnetic energy density E$_{free}$, total unsigned magnetic flux $Φ$$_{HED}$, mean unsigned current helicity h$_{c}$, length of the polarity inversion lines $L$$_{PIL}…

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

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and QUANTIFIED SAT or, more generally, QUANTIFIED CSP, are FPT parameterized by the tw of the input's (primal) graph plus the length of the MSO-formula [Courcelle, Information & Computation 1990] and the quantifier rank [Chen, ECAI 2004], resp. The algorithms from these (meta-)results have running times whose dependence o…

Controlling polymer translocation with crowded medium and polymer length asymmetry
Vrinda Garg, Rejoy Mathew, Riyan Ibrahim, Kulveer Singh, Surya K. Ghosh
https://arxiv.org/abs/2402.19187

Controlling polymer translocation with crowded medium and polymer length asymmetry
Polymer translocation in crowded environments is a ubiquitous phenomenon in biological systems. We studied polymer translocation through a pore in free, one-sided (asymmetric), and two-sided (symmetric) crowded environments. Extensive Langevin dynamics simulation is employed to model the dynamics of the flexible polymer and crowding particles. We studied how crowding size and packing fraction play a crucial role in the translocation process. After determining the standard scaling properties of …

Generalizing Roberts' characterization of unit interval graphs
Virginia Ard\'evol Mart\'inez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, St\'ephane Vialette
https://arxiv.org/abs/2404.17872

Generalizing Roberts' characterization of unit interval graphs
For any natural number $d$, a graph $G$ is a (disjoint) $d$-interval graph if it is the intersection graph of (disjoint) $d$-intervals, the union of $d$ (disjoint) intervals on the real line. Two important subclasses of $d$-interval graphs are unit and balanced $d$-interval graphs (where every interval has unit length or all the intervals associated to a same vertex have the same length, respectively). A celebrated result by Roberts gives a simple characterization of unit interval graphs being …

https://coredumped.dev/2023/08/09/text-showdown-gap-buffers-vs-ropes/ - Text showdown: gap buffers vs ropes.

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

Variable-Length Stop-Feedback Coding for Minimum Age of Incorrect Information
The Age of Incorrect Information (AoII) is examined within the context of remote monitoring of a Markov source using variable-length stop-feedback (VLSF) coding. Leveraging recent results on the non-asymptotic channel coding rate, we consider sources with small cardinality, where feedback is non-instantaneous as the transmitted information and feedback message have comparable lengths. We focus on the feedback sequence, i.e. the times of feedback transmissions, and derive AoII-optimal and delay-…

Dimensional crossover in Kardar-Parisi-Zhang growth
Ismael S. S. Carrasco, Tiago J. Oliveira
https://arxiv.org/abs/2404.19516 https://

Dimensional crossover in Kardar-Parisi-Zhang growth
Two-dimensional (2D) KPZ growth is usually investigated on substrates of lateral sizes $L_x=L_y$, so that $L_x$ and the correlation length ($ξ$) are the only relevant lengths determining the scaling behavior. However, in cylindrical geometry, as well as in flat rectangular substrates $L_x \neq L_y$ and, thus, the surfaces can become correlated in a single direction, when $ξ\sim L_x \ll L_y$. From extensive simulations of several KPZ models, we demonstrate that this yields a dimensional crosso…

Retrieval-based Full-length Wikipedia Generation for Emergent Events
Jiebin Zhang, Eugene J. Yu, Qinyu Chen, Chenhao Xiong, Dawei Zhu, Han Qian, Mingbo Song, Xiaoguang Li, Qun Liu, Sujian Li
https://arxiv.org/abs/2402.18264

Retrieval-based Full-length Wikipedia Generation for Emergent Events
In today's fast-paced world, the growing demand to quickly generate comprehensive and accurate Wikipedia documents for emerging events is both crucial and challenging. However, previous efforts in Wikipedia generation have often fallen short of meeting real-world requirements. Some approaches focus solely on generating segments of a complete Wikipedia document, while others overlook the importance of faithfulness in generation or fail to consider the influence of the pre-training corpus. In thi…

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

Three-body scattering area for particles with infinite or zero scattering length in two dimensions
We derive the asymptotic expansions of the wave function of three particles having equal mass with finite-range interactions and infinite or zero two-dimensional scattering length colliding at zero energy and zero orbital angular momentum, from which a three-body parameter $D$ is defined. The dimension of $D$ is length squared, and we call $D$ three-body scattering area. We find that the ground state energy per particle of a zero-temperature dilute Bose gas with these interactions is approximat…

Investigation of the determination of nuclear deformation using high-energy heavy-ion scattering
Shin Watanabe, Takenori Furumoto, Wataru Horiuchi, Tadahiro Suhara, Yasutaka Taniguchi
https://arxiv.org/abs/2402.19008

Investigation of the determination of nuclear deformation using high-energy heavy-ion scattering
Background: Nuclear deformation provides a crucial characteristic of nuclear structure. Conventionally, the quadrupole deformation length of a nucleus, $δ_{2}$, has often been determined based on a macroscopic model through a deformed nuclear potential with the deformation length $δ^{\rm (pot)}_{2}$, which is determined to reproduce the nuclear scattering data. This approach assumes $δ_{2}=δ^{\rm (pot)}_{2}$ although there is no theoretical foundation. Purpose: We clarify the relationship b…

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

Rigidity for Lorentzian metrics with the same length of null-geodesics
We study the Lorentzian metric independent of the time variable in the cylinder $\mathbb{R}\timesΩ$ where $x_0\in\mathbb{R}$ is the time variable and $Ω$ is a bounded smooth domain in $\mathbb{R}^n$. We consider forward null-geodesics in $\mathbb{R}\times Ω$ starting on $\mathbb{R}\times\partialΩ$ at $t=0$ and leaving $\mathbb{R}\timesΩ$ at some later time. We prove the following rigidity result: If two Lorentzian metrics are close enough in some norm and if corresponding null-geodesics ha…

All-optical blast wave control of laser wakefield acceleration in near critical plasma
I. Tsymbalov, D. Gorlova, K. Ivanov, E. Starodubtseva, R. Volkov, I. Tsygvintsev, Yu. Kochetkov, Ph. Korneev, A. Polonski, A. Savelev
https://arxiv.org/abs/2403.19828

All-optical blast wave control of laser wakefield acceleration in near critical plasma
We propose a novel method for changing the length of laser wakefield electron acceleration in a gas jet by a cylindrical blast wave created by a perpendicularly focused nanosecond laser pulse. The shock front destroys the wake thus stopping interaction between the laser pulse and accelerated electron bunch allowing one to directly control the interaction length and avoid dephasing. It also improves the electron beam quality through the plasma lensing effect between the two shock fronts. We demo…

The mathematician John von Neumann used the term #microcentury to denote the maximum length of a lecture.
One microcentury is 52 minutes and 35.7 seconds‍—  one millionth of a century
https://susam.net/microcentury.html

"‘We’re not going for a picnic’: The Olympic teams hitting back against Paris’ no A/C green policy"
#Paris #France #Olympics

Fearing a heatwave, Olympic teams are bringing portable A/C to Paris
Teams say they’ll go to any length to keep their athletes cool.

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

Impact of a $MoS_2$ monolayer on the nanoscale thermoelastic response of silicon heterostructures
Understanding the thermoelastic response of a nanostructure is crucial for the choice of materials and interfaces in electronic devices with improved and tailored transport properties, at the length scales of the present technology. Here we show how the deposition of a $MoS_2$ monolayer can strongly modify the nanoscale thermoelastic dynamics of silicon substrates close to their interface. We achieve this result by creating a transient grating with extreme ultraviolet light, using ultrashort fr…

@… I did a gel-cut DNA ladder sequencing run yesterday. Here are my experiment notes:
http://dx.doi.org/10.13140/RG.2.2.35994.82880

Breaking the Length Barrier: LLM-Enhanced CTR Prediction in Long Textual User Behaviors
Binzong Geng, Zhaoxin Huan, Xiaolu Zhang, Yong He, Liang Zhang, Fajie Yuan, Jun Zhou, Linjian Mo
https://arxiv.org/abs/2403.19347

Breaking the Length Barrier: LLM-Enhanced CTR Prediction in Long Textual User Behaviors
With the rise of large language models (LLMs), recent works have leveraged LLMs to improve the performance of click-through rate (CTR) prediction. However, we argue that a critical obstacle remains in deploying LLMs for practical use: the efficiency of LLMs when processing long textual user behaviors. As user sequences grow longer, the current efficiency of LLMs is inadequate for training on billions of users and items. To break through the efficiency barrier of LLMs, we propose Behavior Aggreg…

Pitch perfect. 😂 #academia #HigherEducation https://www.mcsweeneys.net/articl…

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

A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs
Dirac proved that each $n$-vertex $2$-connected graph with minimum degree at least $k$ contains a cycle of length at least $\min\{2k, n\}$. We consider a hypergraph version of this result. A Berge cycle in a hypergraph is an alternating sequence of distinct vertices and edges $v_1,e_2,v_2, \ldots, e_c, v_1$ such that $\{v_i,v_{i+1}\} \subseteq e_i$ for all $i$ (with indices taken modulo $c$). We prove that for $n \geq k \geq r+2 \geq 5$, every $2$-connected $r$-uniform $n$-vertex hypergraph wit…

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

Finite sample rates for logistic regression with small noise or few samples
The logistic regression estimator is known to inflate the magnitude of its coefficients if the sample size $n$ is small, the dimension $p$ is (moderately) large or the signal-to-noise ratio $1/σ$ is large (probabilities of observing a label are close to 0 or 1). With this in mind, we study the logistic regression estimator with $p\ll n/\log n$, assuming Gaussian covariates and labels generated by the Gaussian link function, with a mild optimization constraint on the estimator's length to ensur…

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

Ada-NAV: Adaptive Trajectory Length-Based Sample Efficient Policy Learning for Robotic Navigation
Trajectory length stands as a crucial hyperparameter within reinforcement learning (RL) algorithms, significantly contributing to the sample inefficiency in robotics applications. Motivated by the pivotal role trajectory length plays in the training process, we introduce Ada-NAV, a novel adaptive trajectory length scheme designed to enhance the training sample efficiency of RL algorithms in robotic navigation tasks. Unlike traditional approaches that treat trajectory length as a fixed hyperpara…

ARTiST: Automated Text Simplification for Task Guidance in Augmented Reality
Guande Wu, Jing Qian, Sonia Castelo, Shaoyu Chen, Joao Rulff, Claudio Silva
https://arxiv.org/abs/2402.18797

ARTiST: Automated Text Simplification for Task Guidance in Augmented Reality
Text presented in augmented reality provides in-situ, real-time information for users. However, this content can be challenging to apprehend quickly when engaging in cognitively demanding AR tasks, especially when it is presented on a head-mounted display. We propose ARTiST, an automatic text simplification system that uses a few-shot prompt and GPT-3 models to specifically optimize the text length and semantic content for augmented reality. Developed out of a formative study that included seve…

Around Don's conjecture for binary completely reachable automata
Yinfeng Zhu
https://arxiv.org/abs/2402.19089 https://arxiv.org/p…

Around Don's conjecture for binary completely reachable automata
A word $w$ is called a reaching word of a subset $S$ of states in a deterministic finite automaton (DFA) if $S$ is the image of $Q$ under the action of $w$. A DFA is called completely reachable if every non-empty subset of the state set has a reaching word. A conjecture states that in every $n$-state completely reachable DFA, for every $k$-element subset of states, there exists a reaching word of length at most $n(n-k)$. We present infinitely many completely reachable DFAs with two letters that…

Can confirm no one around Chicago covers him much anymore
From: @…
https://photog.social/@ewen/111997847660778609

Small Ball Probabilities for Simple Random Tensors
Xuehan Hu, Grigoris Paouris
https://arxiv.org/abs/2403.20192 https://arxiv.org/pdf…

Small Ball Probabilities for Simple Random Tensors
We study the small ball probability of an order-$\ell$ simple random tensor $X=X^{(1)}\otimes\cdots\otimes X^{(\ell)}$ where $X^{(i)}, 1\leq i\leq\ell$ are independent random vectors in $\mathbb{R}^n$ that are log-concave or have independent coordinates with bounded densities. We show that the probability that the projection of $X$ onto an $m$-dimensional subspace $F$ falls within an Euclidean ball of length $\varepsilon$ is upper bounded by $\frac{\varepsilon}{(\ell-1)!}\left(C\log\left(\frac{…

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
Krister M. Swenson
https://arxiv.org/abs/2403.20165 https://

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
In 1937, biologists Sturtevant and Tan posed a computational question: transform a chromosome represented by a permutation of genes, into a second permutation, using a minimum-length sequence of reversals, each inverting the order of a contiguous subset of elements. Solutions to this problem, applied to Drosophila chromosomes, were computed by hand. The first algorithmic result was a heuristic that was published in 1982. In the 1990s a more biologically relevant version of the problem, where th…

Just learned from @… that the text-wrap property in #CSS has two new(ish) values: balance and pretty.
“The balance value is good for headings, and tries to balance the number of characters on each line so that each line of the heading is about the same lengt…

Better type layouts with CSS
Today, I wanted to quickly share two newer CSS properties that make it easier to create nice, well-balanced layouts. The text-wrap property has two newish values: balance and pretty. The balance value is good for headings, and tries to balance the number of characters on each line so that each line of the heading is about the same length. The pretty value attempts to reduce orphans (instances where one word is all by itself on a line).

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

Cosmological perturbations from five-dimensional inflation
It was recently proposed that five-dimensional inflation can relate the causal size of the observable universe to the present weakness of gravitational interactions by blowing up an extra compact dimension from the microscopic fundamental length of gravity to a large size in the micron range, as required in the Dark Dimension proposal. Here, we compute the power spectrum of all primordial fluctuations emerging from a 5-dimensional inflaton in a slow-roll region of its potential, showing an inte…

Was NOT expecting to get a new PATHOLOGY album this year but we are! Their next full length 'Unholy Descent' is out May 17, and this is the first single from it, "Cult of the Black Triangle".
Pathology is one of the heaviest, most intense bands around, and I'm psyched to hear the rest of this record.
https://…

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

Emergency Department Decision Support using Clinical Pseudo-notes
In this work, we introduce the Multiple Embedding Model for EHR (MEME), an approach that serializes multimodal EHR tabular data into text using pseudo-notes, mimicking clinical text generation. This conversion not only preserves better representations of categorical data and learns contexts but also enables the effective employment of pretrained foundation models for rich feature representation. To address potential issues with context length, our framework encodes embeddings for each EHR modal…

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

Length-Factoriality and Pure Irreducibility
An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The notion of length-factoriality was introduced by J. Coykendall and W. Smith in 2011 under the term 'other-half-factoriality': they used length-factoriality to provide a characterization of unique factorization domains. In this paper, we study length-factoriality …

Survey of Magnetic Field Parameters Associated With Large Solar Flares
Ting Li, Yanfang Zheng, Xuefeng Li, Yijun Hou, Xuebao Li, Yining Zhang, Anqin Chen
https://arxiv.org/abs/2402.18890

Survey of Magnetic Field Parameters Associated With Large Solar Flares
Until now, how the magnetic fields in M/X-class flaring active regions (ARs) differ from C-class flaring ARs remains unclear. Here, we calculate the key magnetic field parameters within the area of high photospheric free energy density (HED region) for 323 ARs (217 C- and 106 M$/$X-flaring ARs), including total photospheric free magnetic energy density E$_{free}$, total unsigned magnetic flux $Φ$$_{HED}$, mean unsigned current helicity h$_{c}$, length of the polarity inversion lines $L$$_{PIL}…

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

Distortion in graphs of groups and Rapid Decay classification of 3-manifold groups
The fundamental group of a closed irreducible 3-dimensional manifold has the Rapid Decay property if and only if it is not virtually Sol. This is proved by studying distortion of length functions in graphs of groups, and the stability of the Rapid Decay property in polynomially distorted graphs of groups.

Trump will soon face a jury of everyday Americans in Manhattan on criminal charges. This case set the pattern for his presidency: lying in order to seize or hold power. The 2020 federal and Georgia election interference prosecutions show the length to which Trump is willing to go to hold onto power.

Telling detail from the Manhattan Criminal Courthouse (by Nate Schweber for the NY Times): The NYPD is working in the service of the defendant Trump, rather than the people of New York.
#Trump #NewYork

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

Percolative supercurrent in superconductor--ferromagnetic-insulator bilayers
We report tunneling spectroscopy and transport measurements in superconducting Al and ferromagnetic-insulator EuS bilayers. The samples display remanent spin-splitting, roughly half the superconducting gap, and supercurrent transport above the average paramagnetic limit. We interpret this behavior as arising from the interplay between two characteristic length scales: the superconducting coherence length, $ξ$, and the magnetic domain size, $d$. By comparing experimental results to a theoretica…

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

Exact results on generalized Erdős-Gallai problems
Generalized Turán problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of size $t$ in a graph of a fixed order that does not contain any path (or cycle) of length at least a given number. Both of the path-free and cycle-free extremal problems were recently considered and asymptotically solved by Luo. We fully resolve these problems by characterizing all possible extremal graphs. We further ex…

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

Spectral analysis of a viscoelastic tube conveying fluid with generalised boundary conditions
We study the spectral problem associated with the equation governing the small transverse motions of a viscoelastic tube of finite length conveying an ideal fluid. The boundary conditions considered are of general form, accounting for a combination of elasticity and viscous damping acting on both the slopes and the displacements of the ends of the tube. These include many standard boundary conditions as special cases such as the clamped, free, hinged, and guided conditions. We derive explicit a…

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

RelayAttention for Efficient Large Language Model Serving with Long System Prompts
Practical large language model (LLM) services may involve a long system prompt, which specifies the instructions, examples, and knowledge documents of the task and is reused across numerous requests. However, the long system prompt causes throughput/latency bottlenecks as the cost of generating the next token grows w.r.t. the sequence length. This paper aims to improve the efficiency of LLM services that involve long system prompts. Our key observation is that handling these system prompts requ…

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

Universal behavior of highly-confined heat flow in semiconductor nanosystems: from nanomeshes to metalattices
Nanostructuring on length scales corresponding to phonon mean free paths provides control over heat flow in semiconductors and makes it possible to engineer their thermal properties. However, the influence of boundaries limits the validity of bulk models, while first principles calculations are too computationally expensive to model real devices. Here we use extreme ultraviolet beams to study phonon transport dynamics in a 3D nanostructured silicon metalattice with deep nanoscale feature size, …

Computing Longest Common Subsequence under Cartesian-Tree Matching Model
Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
https://arxiv.org/abs/2402.19146

Computing Longest Common Subsequence under Cartesian-Tree Matching Model
Two strings of the same length are said to Cartesian-tree match (CT-match) if their Cartesian-trees are isomorphic [Park et al., TCS 2020]. Cartesian-tree matching is a natural model that allows for capturing similarities of numerical sequences. Oizumi et al. [CPM 2022] showed that subsequence pattern matching under CT-matching model can be solved in polynomial time. This current article follows and extends this line of research: We present the first polynomial-time algorithm that finds the lon…

@… I did a gel-cut DNA ladder sequencing run yesterday. Here are my experiment notes:
http://dx.doi.org/10.13140/RG.2.2.35994.82880

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

On the diameter of semigroups of transformations and partitions
For a semigroup $S$ whose universal right congruence is finitely generated (or, equivalently, a semigroup satisfying the homological finiteness property of being type right-$FP_1$), the right diameter of $S$ is a parameter that expresses how `far apart' elements of $S$ can be from each other, in a certain sense. To be more precise, for each finite generating set $U$ for the universal right congruence on $S,$ we have a metric space $(S,d_U)$ where $d_U(a,b)$ is the minimum length of derivations …

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

Ada-NAV: Adaptive Trajectory Length-Based Sample Efficient Policy Learning for Robotic Navigation
Trajectory length stands as a crucial hyperparameter within reinforcement learning (RL) algorithms, significantly contributing to the sample inefficiency in robotics applications. Motivated by the pivotal role trajectory length plays in the training process, we introduce Ada-NAV, a novel adaptive trajectory length scheme designed to enhance the training sample efficiency of RL algorithms in robotic navigation tasks. Unlike traditional approaches that treat trajectory length as a fixed hyperpara…

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

Length of fully faithful framed bicategories
We consider framed bicategories for which identity squares are Cartesian. We call framed bicategories satisfying this condition fully faithful. The length of a double category is a numerical invariant measuring the work it takes to reconstruct the double category from its globular data. It is conjectured that framed bicategories are of length 1. In this paper we prove this conjecture for the case of fully faithful framed bicategories

Hyperuniformity in phase ordering: the roles of activity, noise, and non-constant mobility
Filippo De Luca, Xiao Ma, Cesare Nardini, Michael E. Cates
https://arxiv.org/abs/2405.00508

Hyperuniformity in phase ordering: the roles of activity, noise, and non-constant mobility
Hyperuniformity emerges generically in the coarsening regime of phase-separating fluids. Numerical studies of active and passive systems have shown that the structure factor $S(q)$ behaves as $q^ς$ for $q\to 0$, with hyperuniformity exponent $ς= 4$. For passive systems, this result was explained in 1991 by a qualitative scaling analysis of Tomita, exploiting isotropy at scales much larger than the coarsening length $\ell$. Here we reconsider and extend Tomita's argument to address cases of ac…

Ranked List Truncation for Large Language Model-based Re-Ranking
Chuan Meng, Negar Arabzadeh, Arian Askari, Mohammad Aliannejadi, Maarten de Rijke
https://arxiv.org/abs/2404.18185

Ranked List Truncation for Large Language Model-based Re-Ranking
We study ranked list truncation (RLT) from a novel "retrieve-then-re-rank" perspective, where we optimize re-ranking by truncating the retrieved list (i.e., trim re-ranking candidates). RLT is crucial for re-ranking as it can improve re-ranking efficiency by sending variable-length candidate lists to a re-ranker on a per-query basis. It also has the potential to improve re-ranking effectiveness. Despite its importance, there is limited research into applying RLT methods to this new perspective.…

Was NOT expecting to get a new PATHOLOGY album this year but we are! Their next full length 'Unholy Descent' is out May 17, and this is the first single from it, "Cult of the Black Triangle".
Pathology is one of the heaviest, most intense bands around, and I'm psyched to hear the rest of this record.
https://…

On the length of directed paths in digraphs
Yangyang Cheng, Peter Keevash
https://arxiv.org/abs/2402.16776 https://arxiv.org/pdf/2402…

On the length of directed paths in digraphs
Thomassé conjectured the following strengthening of the well-known Caccetta-Haggkvist Conjecture: any digraph with minimum out-degree $δ$ and girth $g$ contains a directed path of length $δ(g-1)$. Bai and Manoussakis gave counterexamples to Thomassé's conjecture for every even $g\geq 4$. In this note, we first generalize their counterexamples to show that Thomassé's conjecture is false for every $g\geq 4$. We also obtain the positive result that any digraph with minimum out-degree $δ$ and…

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
https://arxiv.org/abs/2402.18090

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
A string $w$ is said to be a minimal absent word (MAW) for a string $S$ if $w$ does not occur in $S$ and any proper substring of $w$ occurs in $S$. We focus on non-trivial MAWs which are of length at least 2. Finding such non-trivial MAWs for a given string is motivated for applications in bioinformatics and data compression. Fujishige et al. [TCS 2023] proposed a data structure of size $Θ(n)$ that can output the set $\mathsf{MAW}(S)$ of all MAWs for a given string $S$ of length $n$ in $O(n + …

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

On the length of directed paths in digraphs
Thomassé conjectured the following strengthening of the well-known Caccetta-Haggkvist Conjecture: any digraph with minimum out-degree $δ$ and girth $g$ contains a directed path of length $δ(g-1)$. Bai and Manoussakis gave counterexamples to Thomassé's conjecture for every even $g\geq 4$. In this note, we first generalize their counterexamples to show that Thomassé's conjecture is false for every $g\geq 4$. We also obtain the positive result that any digraph with minimum out-degree $δ$ and…

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

Limiting Moments of Autocorrelation Demerit Factors of Binary Sequences
An aperiodic binary sequence of length $\ell$ is a doubly infinite sequence $f=\ldots,f_{-1},f_0,f_1,\ldots$ with $f_j \in \{-1,1\}$ when $0 \leq j < \ell$ and and $f_j=0$ otherwise. Various problems in engineering and natural science demand binary sequences that do not resemble translates of themselves. The autocorrelation of $f$ at shift $s$ is the dot product of $f$ with the sequence obtained by translating $f$ by $s$ places. The demerit factor of $f$ is the sum of the squares of the autocor…

New Structures and Algorithms for Length-Constrained Expander Decompositions
Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan
https://arxiv.org/abs/2404.13446

New Structures and Algorithms for Length-Constrained Expander Decompositions
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances and costs. Roughly, an $(h,s)$-length $ϕ$-expander decomposition is a small collection of length increases to a graph so that nodes within distance $h$ can route flow over paths of length $hs$ with congestion at most $1/ϕ$. In this work, we give a close-t…

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

On the length of directed paths in digraphs
Thomassé conjectured the following strengthening of the well-known Caccetta-Haggkvist Conjecture: any digraph with minimum out-degree $δ$ and girth $g$ contains a directed path of length $δ(g-1)$. Bai and Manoussakis gave counterexamples to Thomassé's conjecture for every even $g\geq 4$. In this note, we first generalize their counterexamples to show that Thomassé's conjecture is false for every $g\geq 4$. We also obtain the positive result that any digraph with minimum out-degree $δ$ and…

On generalizations of Iwasawa's theorem
Jiangtao Shi, Fanjie Xu, Mengjiao Shan
https://arxiv.org/abs/2403.17960 https://arxiv.org…

On generalizations of Iwasawa's theorem
Iwasawa's theorem indicates that a finite group $G$ is supersolvable if and only if all maximal chains of the identity in $G$ have the same length. As generalizations of Iwasawa's theorem, we provide some characterizations of the structure of a finite group $G$ in which all maximal chains of every minimal subgroup have the same length. Moreover, let $δ(G)$ be the number of subgroups of $G$ all of whose maximal chains in $G$ do not have the same length, we prove that $G$ is a non-solvable group…

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

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

Prescribing Large Language Models for Perioperative Care: What's The Right Dose for Pre-trained Models?
Postoperative risk predictions can inform effective perioperative care management and planning. We aimed to assess whether clinical large language models (LLMs) can predict postoperative risks using clinical texts with various training strategies. The main cohort involved 84,875 records from Barnes Jewish Hospital (BJH) system between 2018 and 2021. Methods were replicated on Beth Israel Deaconess's MIMIC dataset. Both studies had mean duration of follow-up based on the length of postoperative …

Error-Resilient Weakly Constrained Coding via Row-by-Row Coding
Prachi Mishra, Navin Kashyap
https://arxiv.org/abs/2404.18469 https://

Error-Resilient Weakly Constrained Coding via Row-by-Row Coding
A weakly constrained code is a collection of finite-length strings over a finite alphabet in which certain substrings or patterns occur according to some prescribed frequencies. Buzaglo and Siegel (ITW 2017) gave a construction of weakly constrained codes based on row-by-row coding, that achieved the capacity of the weak constraint. In this paper, we propose a method to make this row-by-row coding scheme resilient to errors.

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

Noncoprime action of a cyclic group
Let $A$ be a finite nilpotent group acting fixed point freely on the finite (solvable) group $G$ by automorphisms. It is conjectured that the nilpotent length of $G$ is bounded above by $\ell(A)$, the number of primes dividing the order of $A$ counted with multiplicities. In the present paper we consider the case $A$ is cyclic and obtain that the nilpotent length of $G$ is at most $2\ell(A)$ if $|G|$ is odd. More generally we prove that the nilpotent length of $G$ is at most $2\ell(A)…

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

A Human-Inspired Reading Agent with Gist Memory of Very Long Contexts
Current Large Language Models (LLMs) are not only limited to some maximum context length, but also are not able to robustly consume long inputs. To address these limitations, we propose ReadAgent, an LLM agent system that increases effective context length up to 20x in our experiments. Inspired by how humans interactively read long documents, we implement ReadAgent as a simple prompting system that uses the advanced language capabilities of LLMs to (1) decide what content to store together in a…

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

On the chromatic number of powers of subdivisions of graphs
For a given graph $G=(V,E)$, we define its $n$-th subdivision as the graph obtained from $G$ by replacing every edge by a path of length $n$. We also define the $m$-th power of $G$ as the graph on vertex set $V$ where we connect every pair of vertices at distance at most $m$ in $G$. In this paper we study the chromatic number of powers of subdivisions of graphs and we obtain an exact bound for $n=3$ and $m=2$. Additionally, we resolve the case $m=n$ asymptotically; in particular, our result con…

On the Semantic Security in the General Bounded Storage Model: A New Proof
Mohammad Moltafet, Hamid R. Sadjadpour, Zouheir Rezki
https://arxiv.org/abs/2403.18935

On the Semantic Security in the General Bounded Storage Model: A New Proof
In the bounded storage model introduced by Maurer, the adversary is computationally unbounded and has a bounded storage capacity. In this model, information-theoretic secrecy is guaranteed by using a publicly available random string whose length is larger than the adversary storage capacity. The protocol proposed by Maurer is simple, from the perspective of implementation, and efficient, from the perspective of the initial secret key size and random string length. However, he provided the proof…

p-Nilpotent maximal subgroups in finite groups
Antonio Beltr\'an, Changguo Shao
https://arxiv.org/abs/2402.18413 https://arxiv.or…

p-Nilpotent maximal subgroups in finite groups
Let $G$ be a finite group, $p$ a prime, and suppose that every maximal subgroup of $G$ is $p$-nilpotent or has prime index in $G$. We prove, relying in the Classification of Finite Simple Groups, that if $p$ is odd and $p\neq 5$, then $G$ is $p$-solvable, and the $p$-length of $G$ is at most $2$. For $p=5$, however, a group $G$ satisfying the same conditions need not be $5$-solvable, and in that case we show that $G/S_5(G)\cong{\rm PSL}_2(11)$, where $S_5(G)$ is the $5$-solvable radical of $G$.…

Optimization of the Downlink Spectral- and Energy-Efficiency of RIS-aided Multi-user URLLC MIMO Systems
Mohammad Soleymani, Ignacio Santamaria, Eduard Jorswieck, Robert Schober, Lajos Hanzo
https://arxiv.org/abs/2402.16434

Optimization of the Downlink Spectral- and Energy-Efficiency of RIS-aided Multi-user URLLC MIMO Systems
Modern wireless communication systems are expected to provide improved latency and reliability. To meet these expectations, a short packet length is needed, which makes the first-order Shannon rate an inaccurate performance metric for such communication systems. A more accurate approximation of the achievable rates of finite-block-length (FBL) coding regimes is known as the normal approximation (NA). It is therefore of substantial interest to study the optimization of the FBL rate in multi-user…

The total chord length of maximal outerplanar graphs
Haley Broadus, Elena Pavelescu
https://arxiv.org/abs/2404.11028 https://arxiv.or…

The total chord length of maximal outerplanar graphs
We consider embeddings of maximal outerplanar graphs whose vertices all lie on a cycle $\mathcal{C}$ bounding a face. Each edge of the graph that is not in $\mathcal{C}$, a chord, is assigned a length equal to the length of the shortest path in $\mathcal{C}$ between its endpoints. We define the total chord length of a graph as the sum of lengths of all its chords. For each order $n\ge 5$, we find outerplanar graphs whose total chord length is minimal among all graphs of the same order, and grap…

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

Moments of Autocorrelation Demerit Factors of Binary Sequences
Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values at every nonzero shift when we normalize the sequence to have unit Euclidean length. The merit factor, introduced by Golay, is the reciprocal of the demerit factor. We consider the uniform probability measure on the $2^\ell$ binary sequences of length $\ell$ …

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

Sign-twisted generating functions of the odd length in Weyl groups of type $D$
The odd length in Weyl groups is a new statistic analogous to the classical Coxeter length, and features combinatorial and parity conditions. We establish an explicit closed product formula for the sign-twisted generating functions of the odd length for parabolic quotients of Weyl groups of type $D$. As a consequence, we verify three conjectures of Brenti and Carnevale on evaluating closed forms for these generating functions. We then give an equivalent condition for the sign-twisted generating…