Search

The analysis of tabular data has traditionally been dominated by gradient-boosted decision trees (GBDTs), known for their proficiency with mixed categorical and numerical features. However, recent deep learning innovations are challenging this dominance. We introduce Mambular, an adaptation of the Mamba architecture optimized for tabular data. We extensively benchmark Mambular against state-of-the-art models, including neural networks and tree-based methods, and demonstrate its competitive performance across diverse datasets. Additionally, we explore various adaptations of Mambular to understand its effectiveness for tabular data. We investigate different pooling strategies, feature interaction mechanisms, and bi-directional processing. Our analysis shows that interpreting features as a sequence and passing them through Mamba layers results in surprisingly performant models. The results highlight Mambulars potential as a versatile and powerful architecture for tabular data analysis, expanding the scope of deep learning applications in this domain. The source code is available at https://github.com/basf/mamba-tabular.

We define Sobolev spaces $H^{\mathfrak{s}}(K_q)$ over a local field $K_q$ of finite characteristic $p>0$, where $q=p^c$ for a prime $p$ and $c\in \mathbb{N}$. This paper introduces novel fractal functions, such as the Weierstrass type and 3-adic Cantor type, as intriguing examples within these spaces and a few others. Employing prime elements, we develop a Multi-Resolution Analysis (MRA) and examine wavelet expansions, focusing on the orthogonality of both basic and fractal wavelet packets at various scales. We utilize convolution theory to construct Haar wavelet packets and demonstrate the orthogonality of all discussed wavelet packets within $H^{\mathfrak{s}}(K_q)$, enhancing the analytical capabilities of these Sobolev spaces.

The mechanism of Kondo screening in strongly correlated molecules with several unpaired electrons on a metal surface is still under debate. Here, we provide a theoretical framework that rationalizes the emergence of Kondo screening involving several extended molecular orbitals with unpaired electrons. We introduce a perturbative model, which provides simple rules to identify the presence of antiferromagnetic spin-flip channels involving charged molecular multiplets responsible for Kondo screening. The Kondo regime is confirmed by numerical renormalization group calculations. In addition, we introduce the concept of Kondo orbitals as molecular orbitals associated with the Kondo screening process, which provide a direct interpretation of experimental $dI/dV$ maps of Kondo resonances. We demonstrate that this theoretical framework can be applied to different strongly correlated open-shell molecules on metal surfaces, obtaining good agreement with previously published experimental data., Comment: 13 pages, 12 figures

The introduction and study of dispersing mobile robots across the nodes of an anonymous graph have recently gained traction and have been explored within various graph classes and settings. While optimal dispersion solution was established for {\em oriented} grids [Kshemkalyani et al., WALCOM 2020], a significant unresolved question pertains to whether achieving optimal dispersion is feasible on an {\em unoriented} grid. This paper investigates the dispersion problem on unoriented grids, considering both non-faulty and faulty robots. The challenge posed by unoriented grids lies in the absence of a clear sense of direction for a single robot moving between nodes, as opposed to the straightforward navigation of oriented grids. We present three deterministic algorithms tailored to our robot model. The first and second algorithms deal with the dispersion of faulty and non-faulty robots, ensuring both time and memory optimization in oriented and unoriented grids, respectively. Faulty robots that are prone to crashing at any time, causing permanent failure. In both settings, we achieve dispersion in $O(\sqrt{n})$ rounds while requiring $O(\log n)$ bits of memory per robot. The third algorithm tackles faulty robots prone to crash faults in an unoriented grid. In this scenario, our algorithm operates within $O(\sqrt{n} \log n)$ time and uses $O(\sqrt{n} \log n)$ bits of memory per robot. The robots need to know the value of $n$ for termination.

Background-oriented schlieren (BOS) is a powerful technique for flow visualization. Nevertheless, the widespread dissemination of BOS is impeded by its dependence on scientific cameras, computing hardware, and dedicated analysis software. In this work, we aim to democratize BOS by providing a smartphone based scientific tool called "Pocket Schlieren". Pocket Schlieren enables users to directly capture, process, and visualize flow phenomena on their smartphones. The underlying algorithm incorporates consecutive frame subtraction (CFS) and optical flow (OF) techniques to compute the density gradients inside a flow. It performs on both engineered and natural background patterns. Using Pocket Schlieren, we successfully visualized the flow produced from a burning candle flame, butane lighter, hot soldering iron, room heater, water immersion heating rod, and a large outdoor butane flame. Pocket Schlieren promises to serve as a frugal yet potent instrument for scientific and educational purposes. We have made it publicly available at doi: 10.5281/zenodo.10949271., Comment: 24 pages, 6 figures, 4 Supplementary figures

We give a characterization of genuinely ramified maps of formal orbifolds in the Tannakian framework. In particular we show that a morphism is genuinely ramified if and only if the pullback of every stable bundle remains stable in the orbifold category. We also give some other characterizations of genuine ramification. This generalizes the results of [BKP1] and [BP1]. In fact, it is a positive characteristic analogue of results in [BKP2]., Comment: Final version

Multi Agent Path Finding (MAPF) seeks the optimal set of paths for multiple agents from respective start to goal locations such that no paths conflict. We address the MAPF problem for a fleet of hybrid-fuel unmanned aerial vehicles which are subject to location-dependent noise restrictions. We solve this problem by searching a constraint tree for which the subproblem at each node is a set of shortest path problems subject to the noise and fuel constraints and conflict zone avoidance. A labeling algorithm is presented to solve this subproblem, including the conflict zones which are treated as dynamic obstacles. We present the experimental results of the algorithms for various graph sizes and number of agents., Comment: 6 pages, 7 figures

Let $f:X\rightarrow Y$ be a generically smooth morphism between irreducible smooth projective curves over an algebraically closed field of arbitrary characteristic. We prove that the vector bundle $((f_*{\mathcal O}_X)/{\mathcal O}_Y)^*$ is virtually globally generated. Moreover, $((f_*{\mathcal O}_X)/{\mathcal O}_Y)^*$ is ample if and only if $f$ is genuinely ramified., Comment: Final version

Leader election is one of the fundamental and well-studied problems in distributed computing. In this paper, we initiate the study of leader election using mobile agents. Suppose $n$ agents are positioned initially arbitrarily on the nodes of an arbitrary, anonymous, $n$-node, $m$-edge graph $G$. The agents relocate themselves autonomously on the nodes of $G$ and elect an agent as a leader such that the leader agent knows it is a leader and the other agents know they are not leaders. The objective is to minimize time and memory requirements. Following the literature, we consider the synchronous setting in which each agent performs its operations synchronously with others and hence the time complexity can be measured in rounds. The quest in this paper is to provide solutions without agents knowing any graph parameter, such as $n$, a priori. We first establish that, without agents knowing any graph parameter a priori, there exists a deterministic algorithm to elect an agent as a leader in $O(m)$ rounds with $O(n\log n)$ bits at each agent. Using this leader election result, we develop a deterministic algorithm for agents to construct a minimum spanning tree of $G$ in $O(m+n\log n)$ rounds using $O(n \log n)$ bits memory at each agent, without agents knowing any graph parameter a priori. Finally, using the same leader election result, we provide improved time/memory results for other fundamental distributed graph problems, namely, gathering, maximal independent set, and minimal dominating sets, removing the assumptions on agents knowing graph parameters a priori., Comment: 25 pages

Elastoinertial turbulence (EIT) is a chaotic flow resulting from the interplay between inertia and viscoelasticity in wall bounded shear flows. Understanding EIT is important because it is thought to set a limit on the effectiveness of turbulent drag reduction in polymer solutions. Here, we analyze simulations of two dimensional EIT in channel flow using Spectral Proper Orthogonal Decomposition (SPOD), discovering a family of traveling wave structures that capture the sheetlike stress fluctuations that characterize EIT. The frequency dependence of the leading SPOD mode contains distinct peaks and the mode structures corresponding to these peaks exhibit well defined traveling structures. The structure of the dominant traveling mode exhibits shift reflect symmetry similar to the viscoelasticity modified Tollmien Schlichting (TS) wave, where the velocity fluctuation in the traveling mode is characterized by large scale regular structures spanning the channel and the polymer stress field is characterized by thin, inclined sheets of high polymer stress localized at the critical layers near the channel walls. The traveling structures corresponding to the higher frequency modes have a very similar structure, but are nested in a region roughly bounded by the critical layer positions of the next lower frequency mode. A simple theory based on the idea that the critical layers of mode $\kappa$ form the "walls" for the structure of mode $\kappa+1$ yields quantitative agreement with the observed wave speeds and critical layer positions, indicating self similarity between the structures. The physical idea behind this theory is that the sheetlike localized stress fluctuations in the critical layer prevent velocity fluctuations from penetrating them., Comment: It has been accepted for publication in the Journal of Fluid Mechanics

Hybrid fuel Unmanned Aerial Vehicles (UAV), through their combination of multiple energy sources, offer several advantages over the standard single fuel source configuration, the primary one being increased range and efficiency. Multiple power or fuel sources also allow the distinct pitfalls of each source to be mitigated while exploiting the advantages within the mission or path planning. We consider here a UAV equipped with a combustion engine-generator and battery pack as energy sources. We consider the path planning and power-management of this platform in a noise-aware manner. To solve the path planning problem, we first present the Mixed Integer Linear Program (MILP) formulation of the problem. We then present and analyze a label-correcting algorithm, for which a pseudo-polynomial running time is proven. Results of extensive numerical testing are presented which analyze the performance and scalability of the labeling algorithm for various graph structures, problem parameters, and search heuristics. It is shown that the algorithm can solve instances on graphs as large as twenty thousand nodes in only a few seconds., Comment: 11 pages, 12 figures

The $q$-Araki-Woods factor associated to a group of orthogonal transformations on a real separable Hilbert space $\mathsf{H}_{\mathbb{R}}$ is full as soon as $\dim\mathsf{H}_{\mathbb{R}}\geq 2$., Comment: 18 pages; minor corrections; final version to appear in JLMS

Let $f : X \rightarrow Y$ be a generically smooth nonconstant morphism between irreducible projective curves, defined over an algebraically closed field, which is \'etale on an open subset of $Y$ that contains both the singular locus of $Y$ and the image, in $Y$, of the singular locus of $X$. We prove that the following statements are equivalent: \begin{enumerate} \item The homomorphism of \'etale fundamental groups $$f_* : \pi_1^{\rm et}(X) \rightarrow\pi_1^{\rm et}(Y)$$ induced by $f$ is surjective. \item There is no nontrivial \'etale covering $\phi : Y' \rightarrow Y$ admitting a morphism $q: X \rightarrow Y'$ such that $\phi\circ q = f$. \item The fiber product $X\times_Y X$ is connected. \item $\dim H^0(X, f^*f_* {\mathcal O}_X)= 1$. \item ${\mathcal O}_Y \subset f_*{\mathcal O}_X$ is the maximal semistable subsheaf. \item The pullback $f^*E$ of every stable sheaf $E$ on $Y$ is also stable. \end{enumerate}, Comment: Final version