Tootfinder

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

Using Zero-shot Prompting in the Automatic Creation and Expansion of Topic Taxonomies for Tagging Retail Banking Transactions
This work presents an unsupervised method for automatically constructing and expanding topic taxonomies using instruction-based fine-tuned LLMs (Large Language Models). We apply topic modeling and keyword extraction techniques to create initial topic taxonomies and LLMs to post-process the resulting terms and create a hierarchy. To expand an existing taxonomy with new terms, we use zero-shot prompting to find out where to add new nodes, which, to our knowledge, is the first work to present such…

Coalgebraic Modal Logic for Dynamic Systems with Uncertainty
Andr\'es Gallardo, Ignacio Viglizzo
https://arxiv.org/abs/2403.06177 https://

Coalgebraic Modal Logic for Dynamic Systems with Uncertainty
In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures, finitely additive probability measures, plausibilty measures (and their duals, belief functions), and possibility measures. We give axioms and inference rules for the associated system of coalgebraic modal logic, and construct the canonical coalgebras to prove a…

3D Uncertain Distance Field Mapping using GMM and GP
Qianqian Zou, Monika Sester
https://arxiv.org/abs/2403.07223 https://arxiv.org/p…

3D Uncertain Distance Field Mapping using GMM and GP
In this study, we address the challenge of constructing continuous three-dimensional (3D) models that accurately represent uncertain surfaces, derived from noisy and incomplete LiDAR scanning data. Building upon our prior work, which utilized the Gaussian Process (GP) and Gaussian Mixture Model (GMM) for structured building models, we introduce a more generalized approach tailored for complex surfaces in urban scenes, where four-dimensional (4D) GMM Regression and GP with derivative observation…

Visualizing, Analyzing and Constructing L-System from Arborized 3D Model Using a Web Application
Nick van Nielen, Fons Verbeek, Lu Cao
https://arxiv.org/abs/2403.06638

Visualizing, Analyzing and Constructing L-System from Arborized 3D Model Using a Web Application
In biology, arborized structures are well represented and typically complex for visualization and analysis. In order to have a profound understanding of the topology of arborized 3D biological model, higher level abstraction is needed. We aim at constructing an abstraction of arborized 3D biological model to an L-system that provides a generalized formalization in a grammar to represent complex structures. The focus of this paper is to combine 3D visualization, analysis and L-system abstraction…

Partisans: Russia constructing barriers to prevent further strikes on Black Sea fleet: https://benborges.xyz/2024/03/27/partisans-russia-constructing.html

Monodromy of elliptic logarithms: some topological methods and effective results
Francesco Tropeano
https://arxiv.org/abs/2402.07741 https://

Monodromy of elliptic logarithms: some topological methods and effective results
We present some effective approaches in studying the relative monodromy group of elliptic logarithms with respect to periods of elliptic schemes. We provide explicit ways of constructing explicit loops which leave periods unchanged but along which logarithms have non-trivial variations. We also get some topological methods and effective results which allow to manage the ramification locus of sections. The paper was inspired by a theorem of Corvaja and Zannier which abstractly determine the rela…

An Effective Way to Determine the Separability of Quantum State
Ma-Cheng Yang, Cong-Feng Qiao
https://arxiv.org/abs/2403.07351 https://

An Effective Way to Determine the Separability of Quantum State
We propose in this work a practical approach, by virtue of correlation matrices of the generic observables, to study the long lasting tough issue of quantum separability. Some general separability conditions are set up through constructing a measurement-induced Bloch space. In essence, these conditions are established due to the self constraint in the space of quantum states. The new approach can not only reproduce many of the prevailing entanglement criteria, but also lead to even stronger res…

Quotients of M-convex sets and M-convex functions
Marie-Charlotte Brandenburg, Georg Loho, Ben Smith
https://arxiv.org/abs/2403.07751 https://

Quotients of M-convex sets and M-convex functions
We unify the study of quotients of matroids, polymatroids, valuated matroids and strong maps of submodular functions in the framework of Murota's discrete convex analysis. As a main result, we compile a list of ten equivalent characterizations of quotients for M-convex sets, generalizing existing formulations for (poly)matroids and submodular functions. We also initiate the study of quotients of M-convex functions, constructing a hierarchy of four separate characterizations. Our investigations …

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

Tortoise: An Authenticated Encryption Scheme
Given the open nature of the Internet, there is a need for authentication schemes to address inherent trust issues. We present Tortoise, an experimental nonce-based authenticated encryption scheme modeled on the Synthetic Counter-in-Tweak. This paper demonstrates a generalizable plug-and-play framework for converting block cipher into Authenticated Encryption with Associated Data. As part of this work, we utilized an XOR procedure for constructing a generic tweakable cipher. Finally, we support…

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

tdCoxSNN: Time-Dependent Cox Survival Neural Network for Continuous-time Dynamic Prediction
The aim of dynamic prediction is to provide individualized risk predictions over time, which are updated as new data become available. In pursuit of constructing a dynamic prediction model for a progressive eye disorder, age-related macular degeneration (AMD), we propose a time-dependent Cox survival neural network (tdCoxSNN) to predict its progression using longitudinal fundus images. tdCoxSNN builds upon the time-dependent Cox model by utilizing a neural network to capture the non-linear effe…

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

Birdtracks of Exotic SU(N) Color Structures
I introduce a systematic procedure for constructing complete and independent sets of interactions of fields transforming under exotic representations of SU(N), in particular the SU(3) gauge group of QCD. It uncovers errors in previous results, starting with interactions of four fields including a single sextet.

Flexible-step MPC for Switched Linear Systems with No Quadratic Common Lyapunov Function
Annika F\"urnsinn, Christian Ebenbauer, Bahman Gharesifard
https://arxiv.org/abs/2404.07870

Flexible-step MPC for Switched Linear Systems with No Quadratic Common Lyapunov Function
In this paper, we develop a systematic method for constructing a generalized discrete-time control Lyapunov function for the flexible-step Model Predictive Control (MPC) scheme, recently introduced in [3], when restricted to the class of linear systems. Specifically, we show that a set of Linear Matrix Inequalities (LMIs) can be used for this purpose, demonstrating its tractability. The main consequence of this LMI formulation is that, when combined with flexible-step MPC, we can effectively st…

The Newman algorithm for constructing polynomials with restricted coefficients and many real roots
Markus Jacob, Fedor Nazarov
https://arxiv.org/abs/2404.07971

The Newman algorithm for constructing polynomials with restricted coefficients and many real roots
Under certain natural sufficient conditions on the sequence of uniformly bounded closed sets $E_k\subset\mathbb{R}$ of admissible coefficients, we construct a polynomial $P_n(x)=1+\sum_{k=1}^n\varepsilon_k x^k$, $\varepsilon_k\in E_k$, with at least $c\sqrt{n}$ distinct roots in $[0,1]$, which matches the classical upper bound up to the value of the constant $c>0$. Our sufficient conditions cover the Littlewood ($E_k=\{-1,1\}$) and Newman ($E_k=\{0,(-1)^k\}$) polynomials and are also necessary …

Constructing Data Transaction Chains Based on Opportunity Cost Exploration
Jie Liu, Tao Feng, Yan Jiang, Peizheng Wang, Chao Wu
https://arxiv.org/abs/2404.05272

Constructing Data Transaction Chains Based on Opportunity Cost Exploration
Data trading is increasingly gaining attention. However, the inherent replicability and privacy concerns of data make it challenging to directly apply traditional trading theories to data markets. This paper compares data trading markets with traditional ones, focusing particularly on how the replicability and privacy of data impact data markets. We discuss how data's replicability fundamentally alters the concept of opportunity cost in traditional microeconomics within the context of data mark…

Humans-in-the-Building: Getting Rid of Thermostats for Optimal Thermal Comfort Control in Energy Management Systems
Jiali Wang, Yang Tang, Luca Schenato
https://arxiv.org/abs/2403.07453

Humans-in-the-Building: Getting Rid of Thermostats for Optimal Thermal Comfort Control in Energy Management Systems
Given the widespread attention to individual thermal comfort, coupled with significant energy-saving potential inherent in energy management systems for optimizing indoor environments, this paper aims to introduce advanced "Humans-in-the-building" control techniques to redefine the paradigm of indoor temperature design. Firstly, we innovatively redefine the role of individuals in the control loop, establishing a model for users' thermal comfort and constructing discomfort signals based on indiv…

Singular linear forms over global function fields
Gukyeong Bang, Taehyeong Kim, Seonhee Lim
https://arxiv.org/abs/2404.07752 https://…

Singular linear forms over global function fields
In this paper, we consider singular linear forms over global function fields of class number one and give an upper bound for the Hausdorff dimension of the set of singular linear forms by constructing an appropriate Margulis function over global function fields.

Expected Performance of Cosmic Muon Veto Detector
Raj ShahHomi Bhabha National Institute, Tata Institute of Fundamental Research, Gobinda MajumderTata Institute of Fundamental Research
https://arxiv.org/abs/2403.06114

Expected Performance of Cosmic Muon Veto Detector
The India-Based Neutrino Observatory (INO) collaboration houses the miniICAL detector, at the transit campus of IICHEP, Madurai, India, which serves as a prototype-detector of the larger Iron-Calorimeter detector (ICAL). The purpose of miniICAL lies in unraveling the intricate engineering challenges inherent in constructing a substantial ICAL-type detector. To explore the feasibility of building a large-scale neutrino experiment at shallow depths the collaboration has embarked upon the construc…

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

Selective conformal inference with false coverage-statement rate control
Conformal inference is a popular tool for constructing prediction intervals (PI). We consider here the scenario of post-selection/selective conformal inference, that is PIs are reported only for individuals selected from an unlabeled test data. To account for multiplicity, we develop a general split conformal framework to construct selective PIs with the false coverage-statement rate (FCR) control. We first investigate the Benjamini and Yekutieli (2005)'s FCR-adjusted method in the present sett…

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

BrainKnow -- Extracting, Linking, and Associating Neuroscience Knowledge
The vast accumulation of neuroscience knowledge presents a challenge for researchers to timely and accurately locate the specific information they require. Constructing a knowledge engine that automatically extracts and organizes information from academic papers can provide researchers with timely and accurate informational services. We present the Brain Knowledge Engine (BrainKnow), which extracts and integrates neuroscience knowledge from published papers from PubMed. BrainKnow comprises a su…

Growth Rate of the Number of Empty Triangles in the Plane
Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen
https://arxiv.org/abs/2402.07775 …

Growth Rate of the Number of Empty Triangles in the Plane
Given a set $P$ of $n$ points in the plane, in general position, denote by $N_Δ(P)$ the number of empty triangles with vertices in $P$. In this paper we investigate by how much $N_Δ(P)$ changes if a point $x$ is removed from $P$. By constructing a graph $G_P(x)$ based on the arrangement of the empty triangles incident on $x$, we transform this geometric problem to the problem of counting triangles in the graph $G_P(x)$. We study properties of the graph $G_P(x)$ and, in particular, show that i…

🪚 Reflectively constructing enums at runtime
(… true Gonzo Java programming)
#java

Reflectively constructing enums at runtime - Highly Suspect Agency
Extending Java enums at runtime. What could go wrong?

"Constructing ‘A Noble Library’: Enriqueta Rylands, a Woman Ahead of her Time": https://blogs.bodleian.ox.ac.uk/oxfordtrainees/constructing-a-noble-library-enriqueta-rylands-a-woman-ahead-of-her-time/

Editing Conceptual Knowledge for Large Language Models
Xiaohan Wang, Shengyu Mao, Ningyu Zhang, Shumin Deng, Yunzhi Yao, Yue Shen, Lei Liang, Jinjie Gu, Huajun Chen
https://arxiv.org/abs/2403.06259

Editing Conceptual Knowledge for Large Language Models
Recently, there has been a growing interest in knowledge editing for Large Language Models (LLMs). Current approaches and evaluations merely explore the instance-level editing, while whether LLMs possess the capability to modify concepts remains unclear. This paper pioneers the investigation of editing conceptual knowledge for LLMs, by constructing a novel benchmark dataset ConceptEdit and establishing a suite of new metrics for evaluation. The experimental results reveal that, although existin…

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

LOTUS: Continual Imitation Learning for Robot Manipulation Through Unsupervised Skill Discovery
We introduce LOTUS, a continual imitation learning algorithm that empowers a physical robot to continuously and efficiently learn to solve new manipulation tasks throughout its lifespan. The core idea behind LOTUS is constructing an ever-growing skill library from a sequence of new tasks with a small number of human demonstrations. LOTUS starts with a continual skill discovery process using an open-vocabulary vision model, which extracts skills as recurring patterns presented in unsegmented dem…

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

Modeling Model Predictive Control: A Category Theoretic Framework for Multistage Control Problems
Model predictive control (MPC) is an optimal control technique which involves solving a sequence of constrained optimization problems across a given time horizon. In this paper, we introduce a category theoretic framework for constructing complex MPC problem formulations by composing subproblems. Specifically, we construct a monoidal category - called Para(Conv) - whose objects are Euclidean spaces and whose morphisms represent constrained convex optimization problems. We then show that the mul…

A pseudo-spectral approach to constructing rotating boson star spacetimes
Nikolay Sukhov
https://arxiv.org/abs/2404.03852 https://arx…

A pseudo-spectral approach to constructing rotating boson star spacetimes
We present a novel numerical solver for the systems of coupled non-linear elliptical differential equations. The solver partitions the computational domain into a set of rectangular pseudo-spectral collocation subdomains and is especially well-suited for working with stiff solutions such as almost shell-like solitonic boson stars. The method can be used in any number of dimensions although is practical for one- to three-dimensional problems. We apply the method to rotating and spherically symme…

"High work autonomy builds a free and relaxed working atmosphere, facilitating knowledge creation and self-determination."
Measuring the decent work of knowledge workers: Constructing and validating a new scale (Yan Geng Gao 2023)
https://www.sciencedirect.com/science/arti

Constructing $\omega$-free Hardy fields
Matthias Aschenbrenner, Lou van den Dries, Joris van der Hoeven
https://arxiv.org/abs/2404.03695 https://

Constructing $ω$-free Hardy fields
We show that every Hardy field extends to an $ω$-free Hardy field. This result relates to classical oscillation criteria for second-order homogeneous linear differential equations. It is essential in [12], and here we apply it to answer questions of Boshernitzan, and to generalize a theorem of his.

The Ideal Glass and the Ideal Disk Packing in Two Dimensions
Viola Bolton-Lum, R. Cameron Dennis, Peter Morse, Eric Corwin
https://arxiv.org/abs/2404.07492

The Ideal Glass and the Ideal Disk Packing in Two Dimensions
The ideal glass, a disordered system of particles with zero configurational entropy, cannot be realized through thermal processes. Nevertheless, we present a method for constructing ideal jammed packings of soft spheres, and thus the zero temperature ideal glass, in two dimensions. In line with the predicted properties, these critically jammed packings have high bulk and shear moduli as well as an anomalously high density. While the absence of pressure scaling in the shear moduli of crystalline…

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

Integrating Uncertainty Awareness into Conformalized Quantile Regression
Conformalized Quantile Regression (CQR) is a recently proposed method for constructing prediction intervals for a response $Y$ given covariates $X$, without making distributional assumptions. However, existing constructions of CQR can be ineffective for problems where the quantile regressors perform better in certain parts of the feature space than others. The reason is that the prediction intervals of CQR do not distinguish between two forms of uncertainty: first, the variability of the condit…

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

Lattice-preserving $\mathcal{ALC}$ ontology embeddings
Generating vector representations (embeddings) of OWL ontologies is a growing task due to its applications in predicting missing facts and knowledge-enhanced learning in fields such as bioinformatics. The underlying semantics of OWL ontologies is expressed using Description Logics (DLs). Initial approaches to generate embeddings relied on constructing a graph out of ontologies, neglecting the semantics of the logic therein. Recent semantic-preserving embedding methods often target lightweight D…

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

Formulations to select assets for constructing sparse index tracking portfolios
In this paper, we study asset selection methods to construct a sparse index tracking portfolio. For its advantage over full replication portfolio, the concept of sparse index tracking portfolio has significant attention in the field of finance and investment management. We propose useful formulations to select assets for sparse index tracking portfolio. Our formulations are described as combinatorial optimization problems, and they can yield various asset selection methods, including some exist…

Learning on the correct class for domain inverse problems of gravimetry
Yihang Chen, Wenbin Li
https://arxiv.org/abs/2403.07393 https://

Learning on the correct class for domain inverse problems of gravimetry
We consider end-to-end learning approaches for inverse problems of gravimetry. Due to ill-posedness of the inverse gravimetry, the reliability of learning approaches is questionable. To deal with this problem, we propose the strategy of learning on the correct class. The well-posedness theorems are employed when designing the neural-network architecture and constructing the training set. Given the density-contrast function as a priori information, the domain of mass can be uniquely determined u…

"Prompt Engineering" is the pseudoscience of constructing prompts for Asinine Inference programs like ChatGPT so as to obtain the desired results. It is today's instance of the Search Engine Optimization profession.
"Prompt Sabotage" is the more satisfying art of creating prompts for such AI programs so as to expose their inherent limitations. Some examples to follow. >>

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
Micha{\l} Derezi\'nski, Christopher Musco, Jiaming Yang
https://arxiv.org/abs/2405.05865

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
We present a new class of preconditioned iterative methods for solving linear systems of the form $Ax = b$. Our methods are based on constructing a low-rank Nyström approximation to $A$ using sparse random sketching. This approximation is used to construct a preconditioner, which itself is inverted quickly using additional levels of random sketching and preconditioning. We prove that the convergence of our methods depends on a natural average condition number of $A$, which improves as the rank…

Probabilistic Byzantine Fault Tolerance (Extended Version)
Diogo Avel\~as, Hasan Heydari, Eduardo Alchieri, Tobias Distler, Alysson Bessani
https://arxiv.org/abs/2405.04606

Probabilistic Byzantine Fault Tolerance (Extended Version)
Consensus is a fundamental building block for constructing reliable and fault-tolerant distributed services. Many Byzantine fault-tolerant consensus protocols designed for partially synchronous systems adopt a pessimistic approach when dealing with adversaries, ensuring safety in a deterministic way even under the worst-case scenarios that adversaries can create. Following this approach typically results in either an increase in the message complexity (e.g., PBFT) or an increase in the number o…

Enhancing LLM-based Test Generation for Hard-to-Cover Branches via Program Analysis
Chen Yang, Junjie Chen, Bin Lin, Jianyi Zhou, Ziqi Wang
https://arxiv.org/abs/2404.04966

Enhancing LLM-based Test Generation for Hard-to-Cover Branches via Program Analysis
Automatic test generation plays a critical role in software quality assurance. While the recent advances in Search-Based Software Testing (SBST) and Large Language Models (LLMs) have shown promise in generating useful tests, these techniques still struggle to cover certain branches. Reaching these hard-to-cover branches usually requires constructing complex objects and resolving intricate inter-procedural dependencies in branch conditions, which poses significant challenges for existing test ge…

Variational Optimization for Constructing Inverse Potentials of Proton-Proton Scattering: A Phase Function Method Study
Lalit Kumar, Arushi Sharma, Anil Khachi, Ayushi Awasthi, O. S. K. S. Sastri
https://arxiv.org/abs/2404.06318

Variational Optimization for Constructing Inverse Potentials of Proton-Proton Scattering: A Phase Function Method Study
Background: The phase-shift analysis for proton-proton scattering has been studied by various research groups using the realistic potentials to be comprised of various internal interactions based on an exchange of pions and mesons, involving a large number of parameters. Purpose: The goal of the research is to construct inverse potentials for various l-channels of proton-proton (pp) elastic scattering using the 3-parameter Morse function in combination with atomic Hulthen by utilizing the phase…

Constructing Modular Tensor Categories with Hopf Algebras
Kun Zhou
https://arxiv.org/abs/2403.02643 https://arxiv.org/pdf/2403.02643<…

Constructing Modular Tensor Categories with Hopf Algebras
A modular tensor category is a non-degenerate ribbon finite tensor category. And a ribbon factorizable Hopf algebra is exactly the Hopf algebra whose finite-dimensional representations form a modular tensor category. The goal of this paper is to construct both semisimple and non-semisimple modular categories with Hopf algebras. In particular, we study central extensions of Hopf algebras and characterize some conditions for a quotient Hopf algebra to be a factorizable one. Then we give a special…

Surrogate modeling for probability distribution estimation:uniform or adaptive design?
Maijia Su, Ziqi Wang, Oreste Salvatore Bursi, Marco Broccardo
https://arxiv.org/abs/2404.07323

Surrogate modeling for probability distribution estimation:uniform or adaptive design?
The active learning (AL) technique, one of the state-of-the-art methods for constructing surrogate models, has shown high accuracy and efficiency in forward uncertainty quantification (UQ) analysis. This paper provides a comprehensive study on AL-based global surrogates for computing the full distribution function, i.e., the cumulative distribution function (CDF) and the complementary CDF (CCDF). To this end, we investigate the three essential components for building surrogates, i.e., types of …

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

Integrability of Large-Charge Sectors in Generic 2D EFTs
It is shown that integrability is an accidental property of generic two-dimensional $O(2)$-symmetric asymptotically-free theories in the regime where the charge density is much larger than the dynamical scale. We show this by constructing an infinite tower of higher-spin conserved currents in the most generic effective Lagrangian at large chemical potential to all orders in perturbative expansion in the renormalization-group invariant coupling constant.

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

Quantum dynamics in one and two dimensions via recursion method
We report an implementation of the recursion method that addresses quantum many-body dynamics in the nonperturbative regime. The method essentially amounts to constructing a Lanczos basis in the space of operators and solving coupled Heisenberg equations in this basis. The reported implementation has two key ingredients: a computer-algebraic routine for symbolic calculation of nested commutators and a procedure to extrapolate the sequence of Lanczos coefficients according to the universal opera…

Control-Oriented Identification for the Linear Quadratic Regulator: Technical Report
Sean Anderson, Jo\~ao Pedro Hespanha
https://arxiv.org/abs/2403.05455 …

Control-Oriented Identification for the Linear Quadratic Regulator: Technical Report
Data-driven control benefits from rich datasets, but constructing such datasets becomes challenging when gathering data is limited. We consider an offline experiment design approach to gathering data where we design a control input to collect data that will most improve the performance of a feedback controller. We show how such a control-oriented approach can be used in a setting with linear dynamics and quadratic objective and, through design of a gradient estimator, solve the problem via stoc…

Good news from The David Suzuki Foundation
To save a world in a grain of sand
Storage systems ensure wind and solar energy is available 24/7. Lithium batteries are good, but come with their own problems. As Euronews Green points out, “Grains of sand, it turns out, are surprisingly roomy when it comes to energy storage.” Following up on a smaller power station it built in Kankaanpää, Finland, in 2022, Polar Night Energy is now constructing the world’s biggest sand battery in Porna…

Geometric Approach to Mirabolic Schur-Weyl Duality of Type A
Zhaobing Fan, Zhicheng Zhang, Haitao Ma
https://arxiv.org/abs/2404.05594 https://

Geometric Approach to Mirabolic Schur-Weyl Duality of Type A
We commence by constructing the mirabolic quantum Schur algebra, utilizing the convolution algebra defined on the variety of triples of two $n$-step partial flags and a vector. Subsequently, we employ a stabilization procedure to derive the mirabolic quantum $\mathfrak{gl}_n$. Then we present the geometric approach of the mirabolic Schur-Weyl duality of type $A$.

Expansion and torsion homology of 3-manifolds
Jonathan Zung
https://arxiv.org/abs/2405.04846 https://arxiv.org/pdf/2405.04846<…

Expansion and torsion homology of 3-manifolds
A Riemannian manifold is a called a good rational expander in dimension $i$ if every $i$-cycle bounds a rational $i+1$-chain of comparatively small volume. We construct 3-manifolds which are good expanders in all dimensions. On the other hand, we show that expanders must be topologically complicated: they must have lots of torsion homology. We also give some applications to topological overlap problems, constructing examples of 3-manifolds with large width over $\mathbb R^2$.

Coarse-grained quantum state tomography with optimal POVM construction
Donghun Jung, Young-Wook Cho, Yosep Kim, Junghyun Lee
https://arxiv.org/abs/2404.06285

Coarse-grained quantum state tomography with optimal POVM construction
Constructing an integrated large-scale qubit system of realistic size requires addressing the challenge of physical crowding among qubits. This constraint poses an issue of coarse-grained (CG) measurement, wherein information from the multi-qubit system is collectively gathered. In this work, we introduce a novel approach to reconstruct the target density matrix from a comprehensive set of Positive Operator-Valued Measures (POVM) using a Parameterized Quantum Circuit (PQC) under the constraint …

On the approximation properties of fast Leja points
Sione Ma`u
https://arxiv.org/abs/2405.05436 https://arxiv.org/pdf/2405.05436

On the approximation properties of fast Leja points
Fast Leja points on an interval are points constructed using a discrete modification of the algorithm for constructing Leja points. Not much about fast Leja points has been proven theoretically. We present an asymptotic property of a triangular interpolation array, and under the assumption that fast Leja points satisfy this property, we prove that they are good for Lagrange interpolation.

"High work autonomy builds a free and relaxed working atmosphere, facilitating knowledge creation and self-determination."
Measuring the decent work of knowledge workers: Constructing and validating a new scale (Yan Geng Gao 2023)
https://www.sciencedirect.com/science/arti

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Jio Oh, Soyeon Kim, Junseok Seo, Jindong Wang, Ruochen Xu, Xing Xie, Steven Euijong Whang
https://arxiv.org/abs/2403.05266

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Large language models (LLMs) have achieved unprecedented performance in various applications, yet their evaluation remains a critical issue. Existing hallucination benchmarks are either static or lack adjustable complexity for thorough analysis. We contend that utilizing existing relational databases is a promising approach for constructing benchmarks due to their accurate knowledge description via functional dependencies. We propose ERBench to automatically convert any relational database into…

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

BrainKnow -- Extracting, Linking, and Associating Neuroscience Knowledge
The vast accumulation of neuroscience knowledge presents a challenge for researchers to timely and accurately locate the specific information they require. Constructing a knowledge engine that automatically extracts and organizes information from academic papers can provide researchers with timely and accurate informational services. We present the Brain Knowledge Engine (BrainKnow), which extracts and integrates neuroscience knowledge from published papers from PubMed. BrainKnow comprises a su…

Wikidata & AI, together again – Wikimedia Tech News https://tech-news.wikimedia.de/en/2024/02/19/wikidata-ai-together-again/

Wikidata & AI, together again - Wikimedia Tech News
The recently launched LangChain is an open-source framework for constructing applications with LLM backends; users can ask ChatGPT a question and have it reference data from the Wikidata knowledge graph before responding.

Solving the bongard-logo problem by modeling a probabilistic model
Ruizhuo Song, Beiming Yuan
https://arxiv.org/abs/2403.03173 https://

Solving the bongard-logo problem by modeling a probabilistic model
Abstract reasoning problems challenge the perceptual and cognitive abilities of AI algorithms, demanding deeper pattern discernment and inductive reasoning beyond explicit image features. This study introduces PMoC, a tailored probability model for the Bongard-Logo problem, achieving high reasoning accuracy by constructing independent probability models. Additionally, we present Pose-Transformer, an enhanced Transformer-Encoder designed for complex abstract reasoning tasks, including Bongard-Lo…

Surrogate modeling for probability distribution estimation:uniform or adaptive design?
Maijia Su, Ziqi Wang, Oreste Salvatore Bursi, Marco Broccardo
https://arxiv.org/abs/2404.07323

Surrogate modeling for probability distribution estimation:uniform or adaptive design?
The active learning (AL) technique, one of the state-of-the-art methods for constructing surrogate models, has shown high accuracy and efficiency in forward uncertainty quantification (UQ) analysis. This paper provides a comprehensive study on AL-based global surrogates for computing the full distribution function, i.e., the cumulative distribution function (CDF) and the complementary CDF (CCDF). To this end, we investigate the three essential components for building surrogates, i.e., types of …

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
Shikha Mehta, Shruthi Sai Chivukula, Colin M. Gray, Ritika Gairola
https://arxiv.org/abs/2405.03674

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
HCI and design researchers have designed, adopted, and customized a range of ethics-focused methods to inscribe values and support ethical decision making in a design process. In this work-in-progress, we add to this body of resources, constructing a method that surfaces the designer's intentions in an action-focused way, encouraging consideration of both manipulative and value-centered roles. Anti-Heroes is a card deck that allows a designer to playfully take on pairs of manipulative (Anti-Her…

Tensor-based Graph Learning with Consistency and Specificity for Multi-view Clustering
Long Shi, Lei Cao, Yunshan Ye, Yu Zhao, Badong Chen
https://arxiv.org/abs/2403.18393

Tensor-based Graph Learning with Consistency and Specificity for Multi-view Clustering
Graph learning is widely recognized as a crucial technique in multi-view clustering. Existing graph learning methods typically involve constructing an adaptive neighbor graph based on probabilistic neighbors and then learning a consensus graph to for clustering, however, they are confronted with two limitations. Firstly, they often rely on Euclidean distance to measure similarity when constructing the adaptive neighbor graph, which proves inadequate in capturing the intrinsic structure among da…

Constructing equilibrium states for Smale spaces
David Parmenter, Mark Pollicott
https://arxiv.org/abs/2403.04646 https://arxiv.org/p…

Constructing equilibrium states for Smale spaces
There are several known constructions of equilibrium states for Hölder continuous potentials in the context of both subshifts of finite type and uniformly hyperbolic systems. In this article we present another method of building such measures, formulated in the unified and more general setting of Smale spaces. This simultaneously extends the authors' previous work for hyperbolic attractors (modelled after Sinai's classical approach for SRB-measures) and gives a new and original construction of…

Extremal Separation Problems for Temporal Instance Queries
Jean Christoph Jung, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev
https://arxiv.org/abs/2405.03511

Extremal Separation Problems for Temporal Instance Queries
The separation problem for a class Q of database queries is to find a query in Q that distinguishes between a given set of `positive' and `negative' data examples. Separation provides explanations of examples and underpins the query-by-example paradigm to support database users in constructing and refining queries. As the space of all separating queries can be large, it is helpful to succinctly represent this space by means of its most specific (logically strongest) and general (weakest) member…

https://www.theguardian.com/global-development/2024/mar/29/surajpura-rajasthan-india-drought-villagers-farmers-climate

Constructing abelian varieties from rank 3 Galois representations with real trace field
Raju Krishnamoorthy, Yeuk Hay Joshua Lam
https://arxiv.org/abs/2403.18138

Constructing abelian varieties from rank 3 Galois representations with real trace field
Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy around a cusp. Suppose further that $L$ extends to an integral model such that the Frobenius traces are contained in a fixed totally real number field. Then, after potentially shrinking $U$, there exists an abelian scheme $f\colon B_U\rightarrow U$ such that $L$ is a summand of $R^2f_*\overline{\ma…

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

Linear-Function Correcting Codes
In this paper, we study linear-function correcting codes, a class of codes designed to protect linear function evaluations of a message against errors. The work "Function-Correcting Codes" by Lenz et al. 2023 provides a graphical representation for the problem of constructing function-correcting codes. We use this graph to get a lower bound the on redundancy required for function correction. By considering the function to be a bijection, such an approach also provides a lower bound on the redun…

On endotrivial complexes and the generalized Dade group
Sam K. Miller
https://arxiv.org/abs/2403.04088 https://arxiv.org/pdf/2403.040…

On endotrivial complexes and the generalized Dade group
Let $p$ be a prime, $G$ a $p$-group, and $k$ a field of characteristic $p$. We give a complete description of the group $\mathcal{E}_k(G)$ of endotrivial complexes, identifying $\mathcal{E}_k(G)$ with the additive subgroup of integer-valued class functions satisfying the Borel-Smith conditions. This is done by constructing a short exact sequence isomorphic to a short exact sequence of rational $p$-biset functors constructed by Bouc and Yalçin, endowing $\mathcal{E}_k$ with rational $p$-biset s…

Quickest Change Detection for Multiple Data Streams Using the James-Stein Estimator
Topi Halme, Venugopal V. Veeravalli, Visa Koivunen
https://arxiv.org/abs/2404.05486

Quickest Change Detection for Multiple Data Streams Using the James-Stein Estimator
The problem of quickest change detection is studied in the context of detecting an arbitrary unknown mean-shift in multiple independent Gaussian data streams. The James-Stein estimator is used in constructing detection schemes that exhibit strong detection performance both asymptotically and non-asymptotically. First, a James-Stein-based extension of the recently developed windowed CuSum test is introduced. Our results indicate that the proposed scheme constitutes a uniform improvement over its…

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Jio Oh, Soyeon Kim, Junseok Seo, Jindong Wang, Ruochen Xu, Xing Xie, Steven Euijong Whang
https://arxiv.org/abs/2403.05266

ERBench: An Entity-Relationship based Automatically Verifiable Hallucination Benchmark for Large Language Models
Large language models (LLMs) have achieved unprecedented performance in various applications, yet their evaluation remains a critical issue. Existing hallucination benchmarks are either static or lack adjustable complexity for thorough analysis. We contend that utilizing existing relational databases is a promising approach for constructing benchmarks due to their accurate knowledge description via functional dependencies. We propose ERBench to automatically convert any relational database into…

Purposeful remixing with generative AI: Constructing designer voice in multimodal composing
Xiao Tan, Wei Xu, Chaoran Wang
https://arxiv.org/abs/2403.19095

Purposeful remixing with generative AI: Constructing designer voice in multimodal composing
Voice, the discursive construction of the writer's identity, has been extensively studied and theorized in composition studies. In multimodal writing, students are able to mobilize both linguistic and non linguistic resources to express their real or imagined identities. But at the same time, when students are limited to choose from available online resources, their voices might be compromised due to the incompatibility between their authorial intentions and the existing materials. This study, …

Coarse-grained quantum state tomography with optimal POVM construction
Donghun Jung, Young-Wook Cho, Yosep Kim, Junghyun Lee
https://arxiv.org/abs/2404.06285

Coarse-grained quantum state tomography with optimal POVM construction
Constructing an integrated large-scale qubit system of realistic size requires addressing the challenge of physical crowding among qubits. This constraint poses an issue of coarse-grained (CG) measurement, wherein information from the multi-qubit system is collectively gathered. In this work, we introduce a novel approach to reconstruct the target density matrix from a comprehensive set of Positive Operator-Valued Measures (POVM) using a Parameterized Quantum Circuit (PQC) under the constraint …

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

Monodromy of elliptic logarithms: some topological methods and effective results
We present some effective approaches in studying the relative monodromy group of elliptic logarithms with respect to periods of elliptic schemes. We provide explicit ways of constructing explicit loops which leave periods unchanged but along which logarithms have non-trivial variations. We also get some topological methods and effective results which allow to manage the ramification locus of sections. The paper was inspired by a theorem of Corvaja and Zannier which abstractly determine the rela…

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

Every countable model of arithmetic or set theory has a pointwise-definable end extension
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of set theory, in which every individual is definable without parameters, challenges this conclusion. In this article, I introduce a flexible new method for constructing pointwise-definable models of arithmetic and set theory, showing furthermore that every coun…

0-Hecke Modules, Domino Tableaux, and Type-$B$ Quasisymmetric Functions
Colin Defant, Dominic Searles
https://arxiv.org/abs/2404.04961 https://

0-Hecke Modules, Domino Tableaux, and Type-$B$ Quasisymmetric Functions
We extend the notion of ascent-compatibility from symmetric groups to all Coxeter groups, thereby providing a type-independent framework for constructing families of modules of $0$-Hecke algebras. We apply this framework in type $B$ to give representation-theoretic interpretations of a number of noteworthy families of type-$B$ quasisymmetric functions. Next, we construct modules of the type-$B$ $0$-Hecke algebra corresponding to type-$B$ analogues of Schur functions and introduce a type-$B$ ana…

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

Decision-making with Speculative Opponent Models
Opponent modeling has benefited a controlled agent's decision-making by constructing models of other agents. Existing methods commonly assume access to opponents' observations and actions, which is infeasible when opponents' behaviors are unobservable or hard to obtain. We propose a novel multi-agent distributional actor-critic algorithm to achieve speculative opponent modeling with purely local information (i.e., the controlled agent's observations, actions, and rewards). Specifically, the act…

Constructing hierarchical time series through clustering: Is there an optimal way for forecasting?
Bohan Zhang, Anastasios Panagiotelis, Han Li
https://arxiv.org/abs/2404.06064

Constructing hierarchical time series through clustering: Is there an optimal way for forecasting?
Forecast reconciliation has attracted significant research interest in recent years, with most studies taking the hierarchy of time series as given. We extend existing work that uses time series clustering to construct hierarchies, with the goal of improving forecast accuracy, in three ways. First, we investigate multiple approaches to clustering, including not only different clustering algorithms, but also the way time series are represented and how distance between time series is defined. We …

Fully Charmed Tetraquark States in $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ Color Structure via QCD Sum Rules
Chun-Meng Tang, Chun-Gui Duan, Liang Tang
https://arxiv.org/abs/2405.05042

Fully Charmed Tetraquark States in $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ Color Structure via QCD Sum Rules
Stimulated by the recent experimental results on the fully-charm tetraquark states, we systematically calculate the mass spectra of the fully-charm tetraquark states in $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ color configuration via QCD sum rules. By constructing nine $8_{[c\bar{c}]}\otimes8_{[c\bar{c}]}$ type currents with quantum numbers $J^{PC}=0^{-+},0^{--},1^{-+},1^{+-},1^{--}$ and $2^{++}$, we perform analytic calculation up to dimension six in the Operator Product Expansion (OPE). We find …

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

Coresets for Kernel Clustering
We devise coresets for kernel $k$-Means with a general kernel, and use them to obtain new, more efficient, algorithms. Kernel $k$-Means has superior clustering capability compared to classical $k$-Means, particularly when clusters are non-linearly separable, but it also introduces significant computational challenges. We address this computational issue by constructing a coreset, which is a reduced dataset that accurately preserves the clustering costs. Our main result is a coreset for kernel…

Energy-superconvergent Runge-Kutta Time Discretizations
Jinjie Liu, Moysey Brio
https://arxiv.org/abs/2405.05448 https://arxiv.org/pd…

Energy-superconvergent Runge-Kutta Time Discretizations
In this paper, we investigate the energy accuracy of explicit Runge-Kutta (RK) time discretization for antisymmetric autonomous linear systems and present a framework for constructing RK methods with an order of energy accuracy much greater than the number of stages. For an $s$-stage, $p$th-order RK method, we show that the energy accuracy can achieve superconvergence with an order up to $2s-p+1$ if $p$ is even. Several energy-superconvergent methods, including five- to seven-stage fourth-order…

Logic Programming with Multiplicative Structures
Matteo Acclavio, Roberto Maieli
https://arxiv.org/abs/2403.03032 https://arxiv.org/p…

Logic Programming with Multiplicative Structures
In the logic programming paradigm, a program is defined by a set of methods, each of which can be executed when specific conditions are met during the current state of an execution. The semantics of these programs can be elegantly represented using sequent calculi, in which each method is linked to an inference rule. In this context, proof search mirrors the program's execution. Previous works introduced a framework in which the process of constructing proof nets is employed to model executions…

Dflow, a Python framework for constructing cloud-native AI-for-Science workflows
Xinzijian Liu, Yanbo Han, Zhuoyuan Li, Jiahao Fan, Chengqian Zhang, Jinzhe Zeng, Yifan Shan, Yannan Yuan, Wei-Hong Xu, Yun-Pei Liu, Yuzhi Zhang, Tongqi Wen, Darrin M. York, Zhicheng Zhong, Hang Zheng, Jun Cheng, Linfeng Zhang, Han Wang
https://arxiv…

Dflow, a Python framework for constructing cloud-native AI-for-Science workflows
In the AI-for-science era, scientific computing scenarios such as concurrent learning and high-throughput computing demand a new generation of infrastructure that supports scalable computing resources and automated workflow management on both cloud and high-performance supercomputers. Here we introduce Dflow, an open-source Python toolkit designed for scientists to construct workflows with simple programming interfaces. It enables complex process control and task scheduling across a distributed…

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

Exact Homomorphic Encryption
Inspired by the concept of fault tolerance quantum computation, this article proposes a framework dubbed Exact Homomorphic Encryption, EHE, enabling exact computations on encrypted data without the need for pre-decryption. The introduction of quantum gates is a critical step for constructing the message encryption and the computation encryption within the framework. Of significance is that both encryptions are respectively accomplished in a multivariate polynomial set generated by quantum gates…

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

On harvesting physical predictions from asymptotically safe quantum field theories
Asymptotic safety is a powerful mechanism for obtaining a consistent and predictive quantum field theory beyond the realm of perturbation theory. It hinges on an interacting fixed point of the Wilsonian renormalization group flow which controls the microscopic dynamics. Connecting the fixed point to observations requires constructing the set of effective actions compatible with this microscopic dynamics. Technically, this information is stored in the UV-critical surface of the fixed point. In t…

On equivalence of the Mellin-Barnes and the Givental integral representations of the Whittaker functions
A. A. Gerasimov, D. R. Lebedev, S. V. Oblezin
https://arxiv.org/abs/2405.05152

On equivalence of the Mellin-Barnes and the Givental integral representations of the Whittaker functions
We construct an integral transformation intertwining the Gelfand-Tsetlin and the (modified) Gauss-Givental realizations of principle series representations of gl(3). This provides a direct identification of the corresponding integral representations for the gl(3)-Whittaker function. The construction essentially uses integral identities due to Barnes and Gustafson thus providing a basis for their representation theory interpretation. The result of this paper might be useful for constructing the …

SCALE: Constructing Structured Natural Language Comment Trees for Software Vulnerability Detection
Xin-Cheng Wen, Cuiyun Gao, Shuzheng Gao, Yang Xiao, Michael R. Lyu
https://arxiv.org/abs/2403.19096

SCALE: Constructing Structured Natural Language Comment Trees for Software Vulnerability Detection
Recently, there has been a growing interest in automatic software vulnerability detection. Pre-trained model-based approaches have demonstrated superior performance than other Deep Learning (DL)-based approaches in detecting vulnerabilities. However, the existing pre-trained model-based approaches generally employ code sequences as input during prediction, and may ignore vulnerability-related structural information, as reflected in the following two aspects. First, they tend to fail to infer th…

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
Shikha Mehta, Shruthi Sai Chivukula, Colin M. Gray, Ritika Gairola
https://arxiv.org/abs/2405.03674

Anti-Heroes: An Ethics-focused Method for Responsible Designer Intentions
HCI and design researchers have designed, adopted, and customized a range of ethics-focused methods to inscribe values and support ethical decision making in a design process. In this work-in-progress, we add to this body of resources, constructing a method that surfaces the designer's intentions in an action-focused way, encouraging consideration of both manipulative and value-centered roles. Anti-Heroes is a card deck that allows a designer to playfully take on pairs of manipulative (Anti-Her…

New degeneration phenomenon for infinite-type Riemann surfaces
Ryo Matsuda
https://arxiv.org/abs/2405.04178 https://arxiv.org/pdf/240…

New degeneration phenomenon for infinite-type Riemann surfaces
Since the Teichmüller space of a surface $R$ is a deformation space of complex structures defined on $R$, its Bers boundary describes the degeneration of complex structures in a certain sense. In this paper, constructing a concrete example, we prove that if S is a Riemann surface of infinite type, there exists a Riemann surface with the marking, which is homeomorphic to the surface $R$ in the Bers boundary. We also show that many such degenerations exist in the Bers boundary.

A Nearly Finitary Matroid that is not $k$-Nearly Finitary
Patrick Tam
https://arxiv.org/abs/2404.04721 https://arxiv.org/pdf/2404.047…

A Nearly Finitary Matroid that is not $k$-Nearly Finitary
The class of $k$-nearly finitary matroids for some natural number $k$ is a subclass of the class of nearly finitary matroids. A natural question is whether this inclusion is proper. We answer this question affirmatively by constructing a nearly finitary matroid that is not $k$-nearly finitary for any $k \in \mathbb{N}$.

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

CoverLib: Classifiers-equipped Experience Library by Iterative Problem Distribution Coverage Maximization for Domain-tuned Motion Planning
Library-based methods are known to be very effective for fast motion planning by adapting an experience retrieved from a precomputed library. This article presents CoverLib, a principled approach for constructing and utilizing such a library. CoverLib iteratively adds an experience-classifier-pair to the library, where each classifier corresponds to an adaptable region of the experience within the problem space. This iterative process is an active procedure, as it selects the next experience ba…

Computer-Assisted Global Analysis for Vibro-Impact Dynamics: A Reduced Smooth Maps Approach
Lanjing Bao, Rachel Kuske, Daniil Yurchenko, Igor Belykh
https://arxiv.org/abs/2404.06291

Computer-Assisted Global Analysis for Vibro-Impact Dynamics: A Reduced Smooth Maps Approach
We present a novel approach for studying the global dynamics of a vibro-impact pair, that is, a ball moving in a harmonically forced capsule. Motivated by a specific context of vibro-impact energy harvesting, we develop the method with broader non-smooth systems in mind. The seeming complications of the impacts of the ball with the capsule are exploited as useful non-smooth features in selecting appropriate return maps. This choice yields a computationally efficient framework for constructing r…

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

Constructing Modular Tensor Categories with Hopf Algebras
A modular tensor category is a non-degenerate ribbon finite tensor category. And a ribbon factorizable Hopf algebra is exactly the Hopf algebra whose finite-dimensional representations form a modular tensor category. The goal of this paper is to construct both semisimple and non-semisimple modular categories with Hopf algebras. In particular, we study central extensions of Hopf algebras and characterize some conditions for a quotient Hopf algebra to be a factorizable one. Then we give a special…

An Essay concerning machine understanding
Herbert L. Roitblat
https://arxiv.org/abs/2405.01840 https://arxiv.org/pdf/2405.01840

An Essay concerning machine understanding
Artificial intelligence systems exhibit many useful capabilities, but they appear to lack understanding. This essay describes how we could go about constructing a machine capable of understanding. As John Locke (1689) pointed out words are signs for ideas, which we can paraphrase as thoughts and concepts. To understand a word is to know and be able to work with the underlying concepts for which it is an indicator. Understanding between a speaker and a listener occurs when the speaker casts his …

Energy-superconvergent Runge-Kutta Time Discretizations
Jinjie Liu, Moysey Brio
https://arxiv.org/abs/2405.05448 https://arxiv.org/pd…

Energy-superconvergent Runge-Kutta Time Discretizations
In this paper, we investigate the energy accuracy of explicit Runge-Kutta (RK) time discretization for antisymmetric autonomous linear systems and present a framework for constructing RK methods with an order of energy accuracy much greater than the number of stages. For an $s$-stage, $p$th-order RK method, we show that the energy accuracy can achieve superconvergence with an order up to $2s-p+1$ if $p$ is even. Several energy-superconvergent methods, including five- to seven-stage fourth-order…

Birdtracks of Exotic SU(N) Color Structures
Thorsten Ohl
https://arxiv.org/abs/2403.04685 https://arxiv.org/pdf/2403.04685

Birdtracks of Exotic SU(N) Color Structures
I introduce a systematic procedure for constructing complete and independent sets of interactions of fields transforming under exotic representations of SU(N), in particular the SU(3) gauge group of QCD. It uncovers errors in previous results, starting with interactions of four fields including a single sextet.

Association schemes arising from non-weakly regular bent functions
Yadi Wei, Jiaxin Wang, Fang-Wei Fu
https://arxiv.org/abs/2404.05251 https://

Association schemes arising from non-weakly regular bent functions
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been extensively studied. Recently, in [13], {Ö}zbudak and Pelen constructed infinite families of symmetric association schemes of classes $5$ and $6$ by using ternary non-weakly regular bent functions.They also stated that constructing $2p$-class association schemes from…

Complex Scaling Method applied to the study of the Swanson Hamiltonian in the broken PT-symmetry phase
Viviano Fern\'andez, Romina Ram\'irez, Marta Reboiro
https://arxiv.org/abs/2405.04599

Complex Scaling Method applied to the study of the Swanson Hamiltonian in the broken PT-symmetry phase
In this work, we study the non-PT symmetry phase of the Swanson Hamiltonian in the framework of the Complex Scaling Method. By constructing a bi-orthogonality relation, we apply the formalism of the response function to analyse the time evolution of different initial wave packages. The Wigner Functions and mean value of operators are evaluated as a function of time. We analyse in detail the time evolution in the neighbourhood of Exceptional Points. We derive a continuity equation for the system…

BrainKnow -- Extracting, Linking, and Associating Neuroscience Knowledge
Cunqing Huangfu, Yi Zeng, Yuwei Wang, Dongsheng Wang, Zizhe Ruan
https://arxiv.org/abs/2403.04346

BrainKnow -- Extracting, Linking, and Associating Neuroscience Knowledge
The vast accumulation of neuroscience knowledge presents a challenge for researchers to timely and accurately locate the specific information they require. Constructing a knowledge engine that automatically extracts and organizes information from academic papers can provide researchers with timely and accurate informational services. We present the Brain Knowledge Engine (BrainKnow), which extracts and integrates neuroscience knowledge from published papers from PubMed. BrainKnow comprises a su…

CVXSADes: a stochastic algorithm for constructing optimal exact regression designs with single or multiple objectives
Chi-Kuang Yeh, Julie Zhou
https://arxiv.org/abs/2405.02983

CVXSADes: a stochastic algorithm for constructing optimal exact regression designs with single or multiple objectives
We propose an algorithm to construct optimal exact designs (EDs). Most of the work in the optimal regression design literature focuses on the approximate design (AD) paradigm due to its desired properties, including the optimality verification conditions derived by Kiefer (1959, 1974). ADs may have unbalanced weights, and practitioners may have difficulty implementing them with a designated run size $n$. Some EDs are constructed using rounding methods to get an integer number of runs at each su…

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

Constructing edge-disjoint Steiner trees in Cartesian product networks
Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. For a graph $F=(V,E)$ and a set $S\subseteq V(F)$ of at least two vertices, \emph{an $S$-Steiner tree} or \emph{a Steiner tree connecting $S$} (or simply, \emph{an $S$-tree}) is a subgraph $T=(V',E')$ of $F$ that is a tree with $S\subseteq V'$. For $S\subseteq V(F)$ and $|S|\geq 2$, the {\it generalized local …

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

Neutrino Mass Matrix in Neutrino-Related Processes
Techniques are developed for constructing amplitudes of neutrino-related processes in terms of the neutrino mass matrix, with no reference to the neutrino mixing matrix. The amplitudes of neutrino oscillations in vacuum and medium, quasi-elastic neutrino scattering, $β$ decays and double-$β$ decays are considered. The proposed approach makes extensive use of Frobenius covariants within the framework of Sylvester's theorem on matrix functions. The in-medium dispersion laws are found in terms o…

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

The power of a single Haar random state: constructing and separating quantum pseudorandomness
In this work, we focus on the following question: what are the cryptographic implications of having access to an oracle that provides a single Haar random quantum state? We show, perhaps surprisingly, that such an oracle is sufficient to construct quantum pseudorandomness. Pseudorandom states (PRS) are a family of states for which it is hard to distinguish between polynomially many copies of either a state sampled uniformly from the family or a Haar random state. A weaker notion, called singl…

A method of constructing pairwise balanced designs containing parallel classes
Douglas R. Stinson
https://arxiv.org/abs/2403.17602 https://

A method of constructing pairwise balanced designs containing parallel classes
The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD. However, after constructing such a PBD, it might be the case that we then want to identify a parallel class of blocks. In this short note, we explore some possible ways of doing this.

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

Post-variational quantum neural networks
Hybrid quantum-classical computing in the noisy intermediate-scale quantum (NISQ) era with variational algorithms can exhibit barren plateau issues, causing difficult convergence of gradient-based optimization techniques. In this paper, we discuss "post-variational strategies", which shift tunable parameters from the quantum computer to the classical computer, opting for ensemble strategies when optimizing quantum models. We discuss various strategies and design principles for constructing indi…

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

Neutrino Mass Matrix in Neutrino-Related Processes
Techniques are developed for constructing amplitudes of neutrino-related processes in terms of the neutrino mass matrix, with no reference to the neutrino mixing matrix. The amplitudes of neutrino oscillations in vacuum and medium, quasi-elastic neutrino scattering, $β$ decays and double-$β$ decays are considered. The proposed approach makes extensive use of Frobenius covariants within the framework of Sylvester's theorem on matrix functions. The in-medium dispersion laws are found in terms o…

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

Confinement in the Transverse Field Ising model on the Heavy Hex lattice
We study the emergence of confinement in the transverse field Ising model on a decorated hexagonal lattice. Using an infinite tensor network state optimised with belief propagation we show how a quench from a broken symmetry state leads to striking nonthermal behaviour underpinned by persistent oscillations and saturation of the entanglement entropy. We explain this phenomenon by constructing a minimal model based on the confinement of elementary excitations, which take the form of various flav…