Search

We report the 77Se-nuclear magnetic resonance (NMR) results of trivalent Yb zigzag chain compound YbAgSe2, which is a sister compound of YbCuS2. The 77Se-NMR spectrum was reproduced by considering two different Se sites with negative Knight shifts and three-axis anisotropy. Above the Neel temperature TN, the Knight shift is proportional to the bulk magnetic susceptibility. Below TN, the extremely broad signal with weak intensity and the relatively sharp signal coexist, suggesting that one is strongly influenced by internal magnetic fields and the other remains relatively unaffected by these fields in the magnetic ordered state. The nuclear spin-lattice relaxation rate 1/T1 remains almost constant above TN and abruptly decreases below TN. In contrast to YbCuS2, a T-linear behavior of 1/T1 at low temperatures was not observed at least down to 1.0 K in YbAgSe2. Our results indicate that the gapless excitation is unique to YbCuS2, or is immediately suppressed in the magnetic fields., Comment: 5 pages, 3 figures

Consider a matroid $M$ whose ground set is equipped with a labeling to an abelian group. A basis of $M$ is called $F$-avoiding if the sum of the labels of its elements is not in a forbidden label set $F$. H\"orsch, Imolay, Mizutani, Oki, and Schwarcz (2024) conjectured that if an $F$-avoiding basis exists, then any basis can be transformed into an $F$-avoiding basis by exchanging at most $|F|$ elements. This proximity conjecture is known to hold for certain specific groups; in the case where $|F| \le 2$; or when the matroid is subsequence-interchangeably base orderable (SIBO), which is a weakening of the so-called strongly base orderable (SBO) property. In this paper, we settle the proximity conjecture for sparse paving matroids or in the case where $|F| \le 4$. Related to the latter result, we present the first known example of a non-SIBO matroid. We further address the setting of multiple group-label constraints, showing proximity results for the cases of two labelings, SIBO matroids, matroids representable over a fixed, finite field, and sparse paving matroids.

Mouse and human brains have different functions that depend on their neuronal networks. In this study, we analyzed nanometer-scale three-dimensional structures of brain tissues of the mouse medial prefrontal cortex and compared them with structures of the human anterior cingulate cortex. The obtained results indicated that mouse neuronal somata are smaller and neurites are thinner than those of human neurons. These structural features allow mouse neurons to be integrated in the limited space of the brain, though thin neurites should suppress distal connections according to cable theory. We implemented this mouse-mimetic constraint in convolutional layers of a generative adversarial network (GAN) and a denoising diffusion implicit model (DDIM), which were then subjected to image generation tasks using photo datasets of cat faces, cheese, human faces, and birds. The mouse-mimetic GAN outperformed a standard GAN in the image generation task using the cat faces and cheese photo datasets, but underperformed for human faces and birds. The mouse-mimetic DDIM gave similar results, suggesting that the nature of the datasets affected the results. Analyses of the four datasets indicated differences in their image entropy, which should influence the number of parameters required for image generation. The preferences of the mouse-mimetic AIs coincided with the impressions commonly associated with mice. The relationship between the neuronal network and brain function should be investigated by implementing other biological findings in artificial neural networks., Comment: 41 pages, 4 figures

This paper provides an overview of the techniques employed by Hibikino-Musashi@Home, which intends to participate in the domestic standard platform league. The team has developed a dataset generator for training a robot vision system and an open-source development environment running on a Human Support Robot simulator. The large language model powered task planner selects appropriate primitive skills to perform the task requested by users. The team aims to design a home service robot that can assist humans in their homes and continuously attends competitions to evaluate and improve the developed system.

We report on the first measurement of $J/\psi$ photoproduction from nuclei in the photon energy range of $7$ to $10.8$ GeV, extending above and below the photoproduction threshold in the free proton of $\sim8.2$ GeV. The experiment used a tagged photon beam incident on deuterium, helium, and carbon, and the GlueX detector at Jefferson Lab to measure the semi-inclusive $A(\gamma,e^+e^-p)$ reaction with a dilepton invariant mass $M(e^+e^-)\sim m_{J/\psi}=3.1$ GeV. The incoherent $J/\psi$ photoproduction cross sections in the measured nuclei are extracted as a function of the incident photon energy, momentum transfer, and proton reconstructed missing light-cone momentum fraction. Comparisons with theoretical predictions assuming a dipole form factor allow extracting a gluonic radius for bound protons of $\sqrt{\langle r^2\rangle}=0.85\pm0.14$ fm. The data also suggest an excess of the measured cross section for sub-threshold production and for interactions with high missing light-cone momentum fraction protons. The measured enhancement can be explained by modified gluon structure for high-virtuality bound-protons.

We establish global bounds for solutions to stationary and time-dependent Schr\"odinger equations associated with the sublaplacian $\mathcal L$ on the Heisenberg group, as well as its pure fractional power $\mathcal L^s$ and conformally invariant fractional power $\mathcal L_s$. The main ingredient is a new abstract uniform weighted resolvent estimate which is proved by using the method of weakly conjugate operators -- a variant of Mourre's commutator method -- and Hardy's type inequalities on the Heisenberg group. As applications, we show Kato-type smoothing effects for the time-dependent Schr\"odinger equation, and spectral stability of the sublaplacian perturbed by complex-valued decaying potentials satisfying an explicit subordination condition. In the local case $s=1$, we obtain uniform estimates without any symmetry or derivative loss, which improve previous results., Comment: 28 pages

We investigate whether algorithms based on arithmetic circuits are a viable alternative to existing solvers for Graph Inspection, a problem with direct application in robotic motion planning. Specifically, we seek to address the high memory usage of existing solvers. Aided by novel theoretical results enabling fast solution recovery, we implement a circuit-based solver for Graph Inspection which uses only polynomial space and test it on several realistic robotic motion planning datasets. In particular, we provide a comprehensive experimental evaluation of a suite of engineered algorithms for three key subroutines. While this evaluation demonstrates that circuit-based methods are not yet practically competitive for our robotics application, it also provides insights which may guide future efforts to bring circuit-based algorithms from theory to practice.

In the fair division problem for indivisible goods, mechanisms that output allocations satisfying fairness concepts, such as envy-freeness up to one good (EF1), have been extensively studied. These mechanisms usually require an arbitrary order of agents as input, which may cause some agents to feel unfair since the order affects the output allocations. In the context of the cake-cutting problem, Manabe and Okamoto (2012) introduced meta-envy-freeness to capture such kind of fairness, which guarantees the absence of envy compared to different orders of agents. In this paper, we introduce position envy-freeness and its relaxation, position envy-freeness up to $k$ goods (PEF$k$), for mechanisms in the fair division problem for indivisible goods, analogous to the meta-envy-freeness. While the round-robin or the envy-cycle mechanism is not PEF1, we propose a PEF1 mechanism that always outputs an EF1 allocation. In addition, in the case of two agents, we prove that any mechanism that always returns a maximum Nash social welfare allocation is PEF1, and propose a modified adjusted winner mechanism satisfying PEF1. We further investigate the round-robin and the envy-cycle mechanisms to measure how far they are from position envy-freeness.

The mini proceedings of the "Fourth International Workshop on the Extension Project for the J-PARC Hadron Experimental Facility (HEF-ex 2024) [https://kds.kek.jp/event/46965]" held at J-PARC, February 19-21, 2024, are presented. The workshop was devoted to discussing the physics case that connects both the present and the future Hadron Experimental Facility at J-PARC, covering a wide range of topics in flavor, hadron, and nuclear physics related to both experimental and theoretical activities being conducted at the facility.

The NP-hard Odd Cycle Transversal problem asks for a minimum vertex set whose removal from an undirected input graph $G$ breaks all odd cycles, and thereby yields a bipartite graph. The problem is well-known to be fixed-parameter tractable when parameterized by the size $k$ of the desired solution. It also admits a randomized kernelization of polynomial size, using the celebrated matroid toolkit by Kratsch and Wahlstr\"{o}m. The kernelization guarantees a reduction in the total $\textit{size}$ of an input graph, but does not guarantee any decrease in the size of the solution to be sought; the latter governs the size of the search space for FPT algorithms parameterized by $k$. We investigate under which conditions an efficient algorithm can detect one or more vertices that belong to an optimal solution to Odd Cycle Transversal. By drawing inspiration from the popular $\textit{crown reduction}$ rule for Vertex Cover, and the notion of $\textit{antler decompositions}$ that was recently proposed for Feedback Vertex Set, we introduce a graph decomposition called $\textit{tight odd cycle cut}$ that can be used to certify that a vertex set is part of an optimal odd cycle transversal. While it is NP-hard to compute such a graph decomposition, we develop parameterized algorithms to find a set of at least $k$ vertices that belong to an optimal odd cycle transversal when the input contains a tight odd cycle cut certifying the membership of $k$ vertices in an optimal solution. The resulting algorithm formalizes when the search space for the solution-size parameterization of Odd Cycle Transversal can be reduced by preprocessing. To obtain our results, we develop a graph reduction step that can be used to simplify the graph to the point that the odd cycle cut can be detected via color coding.

We present an analysis of a stellar occultation event caused by a near-Earth asteroid (98943) 2001 CC21, an upcoming flyby target in the Hayabusa2 extended mission, on March 5, 2023. To accurately determine the asteroid's shape from diffraction-affected light curves, we developed a novel data reduction technique named the Diffracted Occultation's United Simulator for Highly Informative Transient Explorations (DOUSHITE). Using DOUSHITE-generated synthetic models, we derived constraints on (98943) 2001 CC21's shadow shape from the single-chord occultation data. Our results suggest a significant elongation of the shadow with an axis ratio of $b/a = 0.37\pm0.09$. This shape can be crucial for planning Hayabusa2's high-speed flyby to optimise the limited imaging opportunities., Comment: 10 pages, 9 figures, PASJ accepted

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at least $k$. This paper provides a polynomial time algorithm to minimize $k$-distant submodular functions for a fixed positive integer $k$. This result generalizes the tractable result of minimizing 2/3-submodular functions, which satisfy the submodular inequality for at least two pairs formed from every distinct three sets., Comment: 13 pages

The spin-exotic hybrid meson $\pi_{1}(1600)$ is predicted to have a large decay rate to the $\omega\pi\pi$ final state. Using 76.6~pb$^{-1}$ of data collected with the GlueX detector, we measure the cross sections for the reactions $\gamma p \to \omega \pi^+ \pi^- p$, $\gamma p \to \omega \pi^0 \pi^0 p$, and $\gamma p\to\omega\pi^-\pi^0\Delta^{++}$ in the range $E_\gamma =$ 8-10 GeV. Using isospin conservation, we set the first upper limits on the photoproduction cross sections of the $\pi^{0}_{1}(1600)$ and $\pi^{-}_{1}(1600)$. We combine these limits with lattice calculations of decay widths and find that photoproduction of $\eta'\pi$ is the most sensitive two-body system to search for the $\pi_1(1600)$., Comment: 6 pages, 3 figures plus supplemental materials

Autonomous robotic inspection, where a robot moves through its environment and inspects points of interest, has applications in industrial settings, structural health monitoring, and medicine. Planning the paths for a robot to safely and efficiently perform such an inspection is an extremely difficult algorithmic challenge. In this work we consider an abstraction of the inspection planning problem which we term Graph Inspection. We give two exact algorithms for this problem, using dynamic programming and integer linear programming. We analyze the performance of these methods, and present multiple approaches to achieve scalability. We demonstrate significant improvement both in path weight and inspection coverage over a state-of-the-art approach on two robotics tasks in simulation, a bridge inspection task by a UAV and a surgical inspection task using a medical robot.

We measure the spin-density matrix elements (SDMEs) of the $\Delta^{++}(1232)$ in the photoproduction reaction $\gamma p \to \pi^-\Delta^{++}(1232)$ with the GlueX experiment in Hall D at Jefferson Lab. The measurement uses a linearly--polarized photon beam with energies from $8.2$ to $8.8$~GeV and the statistical precision of the SDMEs exceeds the previous measurement by three orders of magnitude for the momentum transfer squared region below $1.4$ GeV$^2$. The data are sensitive to the previously undetermined relative sign between couplings in existing Regge-exchange models. Linear combinations of the extracted SDMEs allow for a decomposition into natural and unnatural--exchange amplitudes. We find that the unnatural exchange plays an important role in the low momentum transfer region.

Differential-phase-shift (DPS) quantum key distribution stands as a promising protocol due to its simple implementation, which can be realized with a train of coherent pulses and a passive measurement unit. To implement the DPS protocol, it is crucial to establish security proofs incorporating practical imperfections in users' devices, however, existing security proofs make unrealistic assumptions on the measurement unit using a Mach-Zehnder interferometer. In this paper, we enhance the implementation security of the DPS protocol by incorporating a major imperfection in the measurement unit. Specifically, our proof enables us to use practical beam splitters with a known range of the transmittance rather than the one with exactly $50\%$, as was assumed in the existing security proofs. Our numerical simulations demonstrate that even with fluctuations of $\pm0.5\%$ in the transmittance from the ideal value, the key rate degrades only by a factor of 0.57. This result highlights the feasibility of the DPS protocol with practical measurement setups., Comment: 30 pages, 8 figures

The performance of quantum key distribution (QKD) protocols is evaluated based on the ease of implementation and key generation rate. Among major protocols, the differential-phase-shift (DPS) protocol has the advantage of simple implementation using a train of coherent pulses and a passive detection unit. Unfortunately, however, its key rate is known to be at least proportional to $\eta^2$ with respect to channel transmission $\eta\to0$. If one can only prove the rate proportional to $\eta^2$ and cannot improve the analysis beyond that, then the DPS protocol will be deemed inferior to other major protocols, such as the decoy BB84 protocol. In this paper, we consider a type of DPS protocol in which the phase of each emitted block comprising $n$ pulses is randomized and significantly improve the analysis of its key rate. Specifically, we reveal that the key rate is proportional to $\eta^{1+\frac{1}{n-2}}$ and this rate is tight. This implies that the DPS protocol can achieve a key rate proportional to $\eta$ for a large number of $n$, which is the same scaling as the decoy BB84 protocol. Our result suggests that the DPS protocol can achieve a combination of both advantages of ease of implementation and a high key generation rate., Comment: 11 pages, 1 figure

Hyperspectral imaging technology has a wide range of applications, including forest management, mineral resource exploration, and Earth surface monitoring. Endmember extraction of hyperspectral images is a key step in leveraging this technology for applications. It aims to identifying the spectral signatures of materials, i.e., the major components in the observed scenes. Theoretically speaking, Hottopixx methods should be effective on problems involving extracting endmembers from hyperspectral images. Yet, these methods are challenging to perform in practice, due to high computational costs. They require us to solve LP problems, called Hottopixx models, whose size grows quadratically with the number of pixels in the image. It is thus still unclear as to whether they are actually effective or not. This study clarifies this situation. We propose an efficient and effective implementation of Hottopixx. Our implementation follows the framework of column generation, which is known as a classical but powerful means of solving large-scale LPs. We show in experiments that our implementation is applicable to the endmember extraction from real hyperspectral images and can provide estimations of endmember signatures with higher accuracy than the existing methods can.

Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate quantum communication to unconditionally detect any malicious behavior of the quantum computer solving any promise problem in ${\sf BQP}$. In this paper, we remove the necessity of the communication of qubits by proposing a "physically classical" verification protocol in which the verifier just sends coherent light to the quantum computer., Comment: 13 pages, 2 figures, v2: Improved the presentation throughout and fixed an error in the proof of the soundness in Sec. III (The results are unchanged except for that the value of $m$ is slightly increased.)

Consider a matroid equipped with a labeling of its ground set to an abelian group. We define the label of a subset of the ground set as the sum of the labels of its elements. We study a collection of problems on finding bases and common bases of matroids with restrictions on their labels. For zero bases and zero common bases, the results are mostly negative. While finding a non-zero basis of a matroid is not difficult, it turns out that the complexity of finding a non-zero common basis depends on the group. Namely, we show that the problem is hard for a fixed group if it contains an element of order two, otherwise it is polynomially solvable. As a generalization of both zero and non-zero constraints, we further study $F$-avoiding constraints where we seek a basis or common basis whose label is not in a given set $F$ of forbidden labels. Using algebraic techniques, we give a randomized algorithm for finding an $F$-avoiding common basis of two matroids represented over the same field for finite groups given as operation tables. The study of $F$-avoiding bases with groups given as oracles leads to a conjecture stating that whenever an $F$-avoiding basis exists, an $F$-avoiding basis can be obtained from an arbitrary basis by exchanging at most $|F|$ elements. We prove the conjecture for the special cases when $|F|\le 2$ or the group is ordered. By relying on structural observations on matroids representable over fixed, finite fields, we verify a relaxed version of the conjecture for these matroids. As a consequence, we obtain a polynomial-time algorithm in these special cases for finding an $F$-avoiding basis when $|F|$ is fixed.

A prevalent issue in practical applications of quantum key distribution (QKD) is the emergence of correlations among the emitted signals. Although recent works have proved the security of QKD in the presence of this imperfection, they rest on the premise that pulse correlations are of finite length. However, this assumption is not necessarily met in practice, since the length of these correlations could be potentially unbounded. Indeed, the first emitted pulse could be correlated with the last one, even if very faintly. Still, intuitively, there should exist a pulse separation threshold after which these correlations become so small as to be essentially negligible, rendering them inconsequential from a security standpoint. Building on this insight, we introduce a general formalism designed to extend existing security proofs to the practically relevant scenario in which pulse correlations have an unbounded length. This approach significantly enhances the applicability of these proofs and the robustness of QKD's implementation security.

We present our optical photometric observations of the 2022 eruption of the recurrent nova U Scorpii (U Sco) using 49,152 data points over 70 d following the optical peak. We have also analyzed its soft X-ray (0.3--1 keV) light curve by the Neil Gehrels Swift Observatory. During the 2022 eruption, the optical plateau stage started 13.8--15.0 d and ended 23.8--25.0 d after the optical peak. The soft X-ray stage started 14.6--15.3 d and ended 38.7--39.5 d after the optical peak. Both stages started later and had shorter durations, and the soft X-ray light curve peaked earlier and was less luminous compared to those during the U Sco 2010 eruption. These points suggest that there were differences in the envelope mass between the different cycles of the nova eruption. Furthermore, we have analyzed the optical eclipses during the 2022 eruption. The primary eclipse was first observed 10.4--11.6 d after the optical peak, earlier than the beginning of the optical plateau stage. This sequence of events can be explained by the receding ejecta photosphere associated with the expanding nova ejecta. We have determined the ingress and egress phases of the primary eclipses and estimated the outer radius of the optical light source centered at the white dwarf (WD). During the optical plateau stage, the source radius remained $\sim$1.2 times larger than the Roche volume radius of the primary WD, being close to the L1 point. When the optical plateau stage ended, the source radius drastically shrank to the tidal truncation radius within a few orbital periods. This previously unresolved phenomenon can be interpreted as a structural change in U Sco where the temporarily expanded accretion disk due to the nova wind returned to a steady state., Comment: 16 pages, 7 figures, 7 tables, accepted for publication in PASJ; doi:10.1093/pasj/psae010

Earthquakes are among the most immediate and deadly natural disasters that humans face. Accurately forecasting the extent of earthquake damage and assessing potential risks can be instrumental in saving numerous lives. In this study, we developed linear regression models capable of predicting seismic intensity distributions based on earthquake parameters: location, depth, and magnitude. Because it is completely data-driven, it can predict intensity distributions without geographical information. The dataset comprises seismic intensity data from earthquakes that occurred in the vicinity of Japan between 1997 and 2020, specifically containing 1,857 instances of earthquakes with a magnitude of 5.0 or greater, sourced from the Japan Meteorological Agency. We trained both regression and classification models and combined them to take advantage of both to create a hybrid model. The proposed model outperformed commonly used Ground Motion Prediction Equations (GMPEs) in terms of the correlation coefficient, F1 score, and MCC. Furthermore, the proposed model can predict even abnormal seismic intensity distributions, a task at conventional GMPEs often struggle.

We prove a uniform weighted resolvent estimate for the massless Klein-Gordon operator on a curved spacetime which is sufficiently close to the Minkowski spacetime. This particularly implies the existence and H\"{o}lder continuity of the limiting resolvents at all energies, as well as the absolute continuity, of the massless Klein-Gordon operator. The proof is based on a simple version of Mourre's commutator method and does not rely on microlocal analysis. We also prove the absence of eigenvalues via the Virial theorem under an ellipticity condition on the commutator of the massless Klein-Gordon operator against the generator of a wick-rotated dilation, which is weaker than the smallness condition for the metric perturbation., Comment: There is a gap in the proof of H\"older continuities of weighted resolvents near zero energy, which strongly diminishes the interest of the paper

The integration of Large Language Models (LLMs) like ChatGPT into the workflows of geotechnical engineering has a high potential to transform how the discipline approaches problem-solving and decision-making. This paper delves into the innovative application of LLMs in geotechnical engineering, as explored in a hands-on workshop held in Tokyo, Japan. The event brought together a diverse group of 20 participants, including students, researchers, and professionals from academia, industry, and government sectors, to investigate practical uses of LLMs in addressing specific geotechnical challenges. The workshop facilitated the creation of solutions for four different practical geotechnical problems as illustrative examples, culminating in the development of an academic paper. The paper discusses the potential of LLMs to transform geotechnical engineering practices, highlighting their proficiency in handling a range of tasks from basic data analysis to complex, multimodal problem-solving. It also addresses the challenges in implementing LLMs, particularly in achieving high precision and accuracy in specialized tasks, and underscores the need for expert oversight. The findings demonstrate LLMs' effectiveness in enhancing efficiency, data processing, and decision-making in geotechnical engineering, suggesting a paradigm shift towards more integrated, data-driven approaches in this field. This study not only showcases the potential of LLMs in a specific engineering domain, but also sets a precedent for their broader application in interdisciplinary research and practice, where the synergy of human expertise and artificial intelligence redefines the boundaries of problem-solving., Comment: Supplementary information will be available upon request

This paper is dedicated to investigating the $L^p$-bounds of wave operators $W_\pm(H,\Delta^2)$ associated with fourth-order Schr\"odinger operators $H=\Delta^2+V$ on $\mathbb{R}^3$. We consider that real potentials satisfy $|V(x)|\lesssim \langle x\rangle^{-\mu}$ for some $\mu>0$. A recent work by Goldberg and Green \cite{GoGr21} has demonstrated that wave operators $W_\pm(H,\Delta^2)$ are bounded on $L^p(\mathbb{R}^3)$ for all $19$, and zero is a regular point of $H$. In this paper, we aim to further establish endpoint estimates for $W_\pm(H,\Delta^2)$ in two significant ways. First, we provide counterexamples that illustrate the unboundedness of $W_\pm(H,\Delta^2)$ on the endpoint spaces $L^1(\mathbb{R}^3)$ and $L^\infty(\mathbb{R}^3)$, even for non-zero compactly supported potentials $V$. Second, we establish weak (1,1) estimates for the wave operators $W_\pm(H,\Delta^2)$ and their dual operators $W_\pm(H,\Delta^2)^*$ in the case where zero is a regular point and $\mu>11$. These estimates depend critically on the singular integral theory of Calder\'on-Zygmund on a homogeneous space $(X,d\omega)$ with a doubling measure $d\omega$., Comment: 29 pages. This a final version in Journal of Spectral Theory,2024

Let $H = \Delta^2 + V$ be the fourth-order Schr\"odinger operator on $\mathbb{R}^3$ with a real-valued fast-decaying potential $V$. If zero is neither a resonance nor an eigenvalue of $H$, then it was recently shown that the wave operators $W_\pm(H, \Delta^2)$ are bounded on $L^p(\mathbb{R}^3)$ for all $1 < p < \infty$ and unbounded at the endpoints $p=1$ and $p=\infty$. This paper is to further establish the $L^p$-boundedness of $W_\pm(H, \Delta^2)$ that exhibit all types of singularities at the zero energy threshold. We first prove that $W_\pm(H, \Delta^2)$ are bounded on $L^p(\mathbb{R}^3)$ for all $1 < p < \infty$ in the first kind resonance case, and then proceed to establish for the second kind resonance case that they are bounded on $L^p(\mathbb{R}^3)$ for all $1 < p < 3$, but not if $3 \le p \le \infty$. In the third kind resonance case, we also show that $W_\pm(H, \Delta^2)$ are bounded on $L^p(\mathbb{R}^3)$ for all $1

We prove uniform resolvent estimates in weighted $L^2$-spaces for radial solutions of the sublaplacian $\mathcal{L}$ on the Heisenberg group $\mathbb{H}^d$. The proofs are based on the multipliers methods, and strongly rely on the use of suitable multipliers and of the associated Hardy inequalities. The constants in our inequalities are explicit and depend only on the dimension $d$. As application of the method, we obtain some suitable smallness and repulsivity conditions on a complex radial potential $V$ on $\mathbb{H}^d$ such that $\mathcal{L}+V$ has no radial eigenfunctions., Comment: 28 pages. Minor typos corrected. arXiv admin note: substantial text overlap with arXiv:2203.07296

This paper describes an overview of the techniques of Hibikino-Musashi@Home, which intends to participate in the domestic standard platform league. The team has developed a dataset generator for the training of a robot vision system and an open-source development environment running on a human support robot simulator. The robot system comprises self-developed libraries including those for motion synthesis and open-source software works on the robot operating system. The team aims to realize a home service robot that assists humans in a home, and continuously attend the competition to evaluate the developed system. The brain-inspired artificial intelligence system is also proposed for service robots which are expected to work in a real home environment.

Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gain new insights about our surroundings. Even if the final application concerns a different problem (such as traversal, finding paths, trees, and flows), decomposing large graphs is often an important subproblem for complexity reduction or parallelization. This report is a summary of discussions that happened at Dagstuhl seminar 23331 on "Recent Trends in Graph Decomposition" and presents currently open problems and future directions in the area of (hyper)graph decomposition.

The formation of chiral magnetic soliton lattice (CSL) is investigated in monoaxial chiral dichalcogenide CrTa$_{3}$S$_{6}$ crystals in terms of a surface barrier, which prevents a penetration of chiral solitons into the system and is an intrinsic origin of hysteresis for the continuous phase transition of nucleation-type, as discussed in the system of quantized vortices in type-II superconductors. The magnetoresistance (MR) was examined with microfabricated platelet samples in different dimensions with regard to the $c$-axis direction of the crystal. The CSL formation was confirmed by the discrete MR changes, reflecting the number of chiral solitons, as well as by the presence of surface barrier, recognized as a fixed ratio of critical magnetic fields during the hysteresis field cycle. We also argue the influence of the surface barrier in the bulk CrTa$_{3}$S$_{6}$ crystals., Comment: 6 pages, 6 figures