Search

Along with his confirmation of the $e$-positivity of all cycle-chord graphs $\theta_{ab1}$, the third author conjectured the $e$-positivity of all theta graphs $\theta_{abc}$. In this paper, we establish the $e$-positivity of all clock graphs $\theta_{ab2}$ by using the composition method. The key idea is to investigate the fibers of certain partial reversal transformation on compositions with all parts at least $2$., Comment: 15 pages, 4 figures

We find a positive $e_I$-expansion for the chromatic symmetric function of KPKP graphs, which are graphs obtained by connecting a vertex in a complete graph with a vertex in the maximal clique of a lollipop graph by a path. This generalizes the positive $e_I$-expansion for the chromatic symmetric function of lollipops obtained by Tom, for that of KPK graphs obtained by Wang and Zhou, and as well for those of KKP graphs and PKP graphs obtained by Qi, Tang and Wang. As an application, we confirm the $e$-positivity of twinned lollipops, which belong to the graph family that is concerned by Stanley and Stembridge's $e$-positivity conjecture. We also discover the first positive $e_I$-expansion for the chromatic symmetric function of kayak paddle graphs which are formed by connecting a vertex on a cycle and a vertex on another cycle with a path. This refines the $e$-positivity of kayak paddle graphs which was obtained by Aliniaeifard, Wang, and van Willigenburg using an expanded version of Gebhard and Sagan's appendable $(e)$-positivity technique., Comment: 22 pages, 8 figures

Entity matching (EM), the task of identifying whether two descriptions refer to the same entity, is essential in data management. Traditional methods have evolved from rule-based to AI-driven approaches, yet current techniques using large language models (LLMs) often fall short due to their reliance on static knowledge and rigid, predefined prompts. In this paper, we introduce Libem, a compound AI system designed to address these limitations by incorporating a flexible, tool-oriented approach. Libem supports entity matching through dynamic tool use, self-refinement, and optimization, allowing it to adapt and refine its process based on the dataset and performance metrics. Unlike traditional solo-AI EM systems, which often suffer from a lack of modularity that hinders iterative design improvements and system optimization, Libem offers a composable and reusable toolchain. This approach aims to contribute to ongoing discussions and developments in AI-driven data management., Comment: 2 pages, compound ai systems 2024

We establish the $e$-positivity of spider graphs of the form $S(4m+2,\, 2m,\, 1)$, which was conjectured by Aliniaeifard, Wang and van Willigenburg. A key to our proof is the $e_I$-expansion formula of the chromatic symmetric function of paths due to Shareshian and Wachs, where the symbol~$I$ indicates integer compositions rather than partitions. Following the strategy of the divide-and-conquer technique, we pick out one or two positive $e_J$-terms for each negative $e_I$-term in an $e$-expression for the spiders, where $J$ are selected to be distinct compositions obtained by rearranging the parts of $I$.

We establish the $e$-positivity of all cycle-chord graphs by using the composition method that is developed by Zhou and the author very recently. Our method is much simpler than the $(e)$-positivity approach that is used for handling cycle-chords with girth at most $4$. We also provide a combinatorial interpretation of the $e_I$-coefficients of the chromatic symmetric functions of cycle-chords., Comment: 7 pages, 3 figures

For any integers $1\leq k\leq n$, we introduce a new family of parking functions called $k$-vacillating parking functions of length $n$. The parking rule for $k$-vacillating parking functions allows a car with preference $p$ to park in the first available spot in encounters among the parking spots numbered $p$, $p-k$, and $p+k$ (in that order and if those spots exists). In this way, $k$-vacillating parking functions are a modification of Naples parking functions, which allow for backwards movement of a car, and of $\ell$-interval parking functions, which allow a car to park in its preference or up to $\ell$ spots in front of its preference. Among our results, we establish a combinatorial interpretation for the numerator of the $n$th convergent of the continued fraction of $\sqrt{2}$, as the number of non-decreasing $1$-vacillating parking functions of length~$n$. Our main result gives a product formula for the enumeration of $k$-vacillating parking functions of length $n$ based on the number of $1$-vacillating parking functions of smaller length. We conclude with some directions for further research., Comment: 12 pages, 1 figure, to appear in Journal of Combinatorics

This work is inspired by Shareshian and Wachs's exquisite formula for the chromatic symmetric function of paths. We develop a composition method to unearth neat noncommutative analogs of chromatic symmetric functions. A symmetric function is $e$-positive if and only if it has a $\Lambda$-positive noncommutative analog. We bring to light short and sweet $\Lambda$-positive noncommutative analogs for the chromatic symmetric functions of tadpoles and barbells. Using these elegant formulas and the composition method, we discover a new family of $e$-positive graphs and call it hat graphs, which are the unicyclic graphs obtained by adding an edge to a path. We also obtain a compact ribbon Schur analog for cycles.

Language Models (LMs) have shown impressive performance in various natural language tasks. However, when it comes to natural language reasoning, LMs still face challenges such as hallucination, generating incorrect intermediate reasoning steps, and making mathematical errors. Recent research has focused on enhancing LMs through self-improvement using feedback. Nevertheless, existing approaches relying on a single generic feedback source fail to address the diverse error types found in LM-generated reasoning chains. In this work, we propose Multi-Aspect Feedback, an iterative refinement framework that integrates multiple feedback modules, including frozen LMs and external tools, each focusing on a specific error category. Our experimental results demonstrate the efficacy of our approach to addressing several errors in the LM-generated reasoning chain and thus improving the overall performance of an LM in several reasoning tasks. We see a relative improvement of up to 20% in Mathematical Reasoning and up to 18% in Logical Entailment., Comment: Accepted at EMNLP 2023 Main Conference, Camera Ready

Multi-criteria recommender systems can improve the quality of recommendations by considering user preferences on multiple criteria. One promising approach proposed recently is multi-criteria ranking, which uses Pareto ranking to assign a ranking score based on the dominance relationship between predicted ratings across criteria. However, applying Pareto ranking to all criteria may result in non-differentiable ranking scores. To alleviate this issue, we proposed a hybrid multi-criteria ranking method by using subsorting. More specifically, we utilize one ranking method as the major sorting approach, while we apply another preference ordering method as subsorting. Our experimental results on the OpenTable and Yahoo!Movies data present the advantages of this hybrid ranking approach. In addition, the experiments also reveal more insights about the sustainability of the multi-criteria ranking for top-N item recommendations.

We obtain the Schur positivity of spider graphs of the forms $S(a,2,1)$ and $S(a,4,1)$, which are considered to have the simpliest structures for which the Schur positivity was unknown. The proof outline has four steps. First, we find noncommutative analogs for the chromatic symmetric functions of the spider graphs $S(a,b,1)$. Secondly, we expand the analogs under the $\Lambda$- and $R$-bases, whose commutative images are the elementary and skew Schur symmetric functions, respectively. Thirdly, we recognize the Schur coefficients via the Littlewood--Richardson rule in terms of norms of multisets of Yamanouchi words. At last we establish the Schur positivity combinatorially together with the aid of computer assistance., Comment: 26 pages, with an appendix of 6 pages

In healthy sleepers, cortical alpha oscillations are present during the transition from wakefulness to sleep, and dissipate at sleep onset. For individuals with insomnia, alpha power is elevated during the wake-sleep transition and can persist throughout the night. Neuromodulation techniques using phase-locked stimulation have been put forth as alternatives to drugs for improving slow-wave sleep quality. Due to technical limitations, this approach has not been tested on faster frequency alpha oscillations. Here we examine the feasibility of using an endpoint-corrected version of the Hilbert Transform (ecHT) algorithm implemented on-device to measure alpha phase and deliver phase-locked auditory stimulation to modulate alpha and promote sleep initiation. First, the ecHT algorithm is implemented on a tabletop electroencephalogram (EEG) device and used to measure the timing of the auditory evoked response and its delivery at precise phases of the alpha oscillation. Secondly, a pilot at-home study tests feasibility to use a wearable version of the neuromodulation device for real-time phase-locked stimulation in the alpha (8-12 Hz) frequency range. Auditory stimulation was delivered at the intended phases of alpha with high precision, and alpha oscillations were affected differently by stimuli delivered at opposing phases. Our wearable system was capable of measuring sleep micro- and macro-events present in the EEG that were appropriate for clinical sleep scoring. Sleep onset latencies were reduced for a subset of subjects displaying sleep onset insomnia symptoms in the stimulation condition. This study demonstrates the feasibility of closed-loop tracking and neuromodulation of alpha oscillations using a wearable EEG device. Preliminary results suggest that this approach could be used to accelerate sleep initiation in individuals with objective insomnia symptoms., Comment: 31 pages, 10 main figures, 5 supplementary figures

We show that the number $A(n,m)$ of partitions with $m$ even parts and largest hook length $n$ is strongly unimodal with mode [(n-1)/4] for $n\ge 6$. We establish this result by induction, using a $5$-term recurrence due to Lin, Xiong and Yan, and two $4$-term recurrences obtained by Zeilberger's algorithm. The sequence $A(n,m)$ is not log-concave. Using M\"obius transformation and the method of interlacing zeros, we obtain that every zero of every generating function $\sum_m A(n,m)z^m$ lies on the left half part of the circle |z-1|=2. Moreover, as a direct application of Wang and Zhang's characterization of root geometry of polynomial sequences that satisfy a recurrence of type $(1,1)$, we see that all these zeros are densely distributed on the half circle.

Accreting protoplanets represent a window into planet formation processes. We report H{\alpha} differential imaging results from the deepest and most comprehensive accreting protoplanet survey to date, acquired with the Magellan Adaptive Optics (MagAO) system's VisAO camera. The fourteen transitional disks targeted are ideal candidates for protoplanet discovery due to their wide, heavily depleted central cavities, wealth of non-axisymmetric circumstellar disk features evocative of ongoing planet formation, and ongoing stellar accretion. To address the twin challenges of morphological complexity in the target systems and PSF instability, we develop novel approaches for frame selection and optimization of the Karhounen-Loeve Image Processing algorithm pyKLIP. We detect one new candidate protoplanet, CS Cha "c", at a separation of 75mas and a Delta mag of 5.1 and robustly recover the HD142527 B and HD100453 B low mass stellar companions across multiple epochs. Though we cannot rule out a substantial scattered light contribution to its emission, we also recover LkCa 15 b. Its presence inside of the cleared disk cavity and consistency with a forward-modeled point source suggest that it remains a viable protoplanet candidate. The protoplanet PDS 70 c was marginally recovered under our conservative general methodology. However, through targeted optimization in H-alpha} imagery, we tentatively recover PDS 70 c in three epochs and PDS 70 b in one epoch. Of the many other previously-reported companions and companion candidates around objects in the sample, we do not recover any additional robust candidates. However, lack of recovery at moderate H-alpha contrast does not rule out the presence of protoplanets at these locations, and we report limiting H-alpha contrasts in such cases., Comment: Final version, in press at AJ

Extensive empirical studies show that the long distribution tail of travel time and the corresponding unexpected delay can have much more serious consequences than expected or moderate delay. However, the unexpected delay due to the distribution tail of travel time has received limited attention in recent studies of the valuation of travel time variability. As a complement to current valuation research, this paper proposes the concept of the value of travel time distribution tail, which quantifies the value that travelers place on reducing the unexpected delay for hedging against travel time variability. Methodologically, we define the summation of all unexpected delays as the unreliability area to quantify travel time distribution tail and show that it is a key element of two well-defined measures accounting for unreliable aspects of travel time. We then formally derive the value of distribution tail, show that it is distinct from the more established value of reliability (VOR), and combine it and the VOR in an overall value of travel time variability (VOV). We prove theoretically that the VOV exhibits diminishing marginal benefit in terms of the traveler's punctuality requirements under a validity condition. This implies that it may be economically inefficient for travelers to blindly pursue a higher probability of not being late. We then proceed to develop the concept of the travel time variability ratio, which gives the implicit cost of the punctuality requirement imposed on any given trip. Numerical examples reveal that the cost of travel time distribution tail can account for more than 10% of the trip cost, such that its omission could introduce non-trivial bias into route choice models and transportation appraisal more generally.

We prove Gebhard and Sagan's $(e)$-positivity of the line graphs of tadpoles in noncommuting variables. This implies the $e$-positivity of these line graphs. We then extend this $(e)$-positivity result to that of certain cycle-chord graphs, and derive the bivariate generating function of all cycle-chord graphs., Comment: 15 pages, 4 figures

We investigate the $e$-positivity and Schur positivity of the chromatic symmetric functions of some spider graphs with three legs. We obtain the positivity classification of all broom graphs and that of most double broom graphs. The methods involve extracting particular $e$-coefficients of the chromatic symmetric function of these graphs with the aid of Orellana and Scott's triple-deletion property, and using the combinatorial formula of Schur coefficients by examining certain special rim hook tabloids. We also propose some conjectures on the $e$-positivity and Schur positivity of trees., Comment: 19 pages, 6 figures

Travellers in autonomous vehicles (AVs) need not to walk to the destination any more after parking like those in conventional human-driven vehicles (HVs). Instead, they can drop off directly at the destination and AVs can cruise for parking autonomously. It is a revolutionary change that such parking autonomy of AVs may increase the potential parking span substantially and affect the spatial parking equilibrium. Given this, from urban planners' perspective, it is of great necessity to reconsider the planning of parking supply along the city. To this end, this paper is the first to examine the spatial parking equilibrium considering the mix of AVs and HVs with parking cruising effect. It is found that the equilibrium solution of travellers' parking location choices can be biased due to the ignorance of cruising effects. On top of that, the optimal parking span of AVs at given parking supply should be no less than that at equilibrium. Besides, the optimal parking planning to minimize the total parking cost is also explored in a bi-level parking planning design problem (PPDP). While the optimal differentiated pricing allows the system to achieve optimal parking distribution, this study suggests that it is beneficial to encourage AVs to cruise further to park by reserving less than enough parking areas for AVs., Comment: 51 pages, 7 figures

This study is part of an effort to improve the Navy's ability to forecast wind-generated ocean waves in ice-infested regions, and here we are attempting to further this goal by improving prediction of dissipation of wave energy by sea ice. Rogers et al. (2021) presented new estimates of frequency-dependent dissipation of wave energy by sea ice, based on model-data inversion, and studied the correlation with various other parameters, such as ice thickness and sea state variables. Here, we use that dataset to propose a new dissipation parameterization which explicitly incorporates the dependence on the ice thickness, in addition to the wave frequency. The goal is to determine whether a parameterization dependent on wave frequency and ice thickness can be more accurate than one dependent only on wave frequency. Due to the dominant impact of frequency and confounding difficulties of field measurements, this is not a foregone conclusion. A parameterization is developed using the non-dimensionalization approach proposed by Yu et al. (2019). We find that the non-dimensionalization does result in significant scale collapse of the data, and inclusion of ice thickness does improve accuracy, most evidenced by reduced scatter when applied to the same dataset. However, evaluations against independent datasets are mixed. Possible reasons for this are discussed., Comment: Technical Report

Flextime is one of the efficient approaches in travel demand management to reduce peak hour congestion and encourage social distancing in epidemic prevention. Previous literature has developed bi-level models of the work starting time choice considering both labor output and urban mobility. Yet, most analytical studies assume the single trip purpose in peak hours (to work) only and do not consider the household travels (daycare drop-off/pick-up). In fact, as one of the main reasons to adopt flextime, household travel plays an influential role in travelers' decision making on work schedule selection. On this account, we incorporate household travels into the work starting time choice model in this study. Both short-run travel behaviours and long-run work start time selection of heterogenous commuters are examined under agglomeration economies. If flextime is not flexible enough, commuters tend to agglomerate in work schedule choice at long-run equilibrium. Further, we analyze optimal schedule choices with two system performance indicators. For total commuting cost, it is found that the rigid school schedule for households may impede the benefits of flextime in commuting cost saving. In terms of total net benefit, while work schedule agglomeration of all commuters leads to the maximum in some cases, the polarized agglomeration of the two heterogenous groups can never achieve the optimum., Comment: 45 pages, 5 figures

A permutation whose any prefix has no more descents than ascents is called a ballot permutation. In this paper, we present a decomposition of ballot permutations that enables us to construct a bijection between ballot permutations and odd order permutations, which proves a set-valued extension of a conjecture due to Spiro using the statistic of peak values. This bijection also preserves the neighbors of the largest letter in permutations and thus resolves a refinement of Spiro' s conjecture proposed by Wang and Zhang. Our decomposition can be extended to well-labelled positive paths, a class of generalized ballot permutations arising from polytope theory, that were enumerated by Bernardi, Duplantier and Nadeau. We will also investigate the enumerative aspect of ballot permutations avoiding a single pattern of length 3 and establish a connection between 213-avoiding ballot permutations and Gessel walks., Comment: 20 pages, 4 figures

The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also found a quadratic recursion for the alternating major index $q$-analog of the alternating descent polynomials. As an interesting application of this quadratic recursion, we show that $(1+q)^{\lfloor n/2\rfloor}$ divides $\sum_{\pi\in\mathfrak{S}_n}q^{\rm{altmaj}(\pi)}$, where $\mathfrak{S}_n$ is the set of all permutations of $\{1,2,\ldots,n\}$ and $\rm{altmaj}(\pi)$ is the alternating major index of $\pi$. This leads us to discover a $q$-analog of $n!=2^{\ell}m$, $m$ odd, using the statistic of alternating major index. Moreover, we study the $\gamma$-vectors of the alternating descent polynomials by using these two recursions and the ${\textbf{cd}}$-index. Further intriguing conjectures are formulated, which indicate that the alternating descent statistic deserves more work., Comment: 21 pages

Motivated by Stanley's $\mathbf{(3+1)}$-free conjecture on chromatic symmetric functions, Foley, Ho\`{a}ng and Merkel introduced the concept of strong $e$-positivity and conjectured that a graph is strongly $e$-positive if and only if it is (claw, net)-free. In order to study strongly $e$-positive graphs, they further introduced the twinning operation on a graph $G$ with respect to a vertex $v$, which adds a vertex $v'$ to $G$ such that $v$ and $v'$ are adjacent and any other vertex is adjacent to both of them or neither of them. Foley, Ho\`{a}ng and Merkel conjectured that if $G$ is $e$-positive, then so is the resulting twin graph $G_v$ for any vertex $v$. Based on the theory of chromatic symmetric functions in non-commuting variables developed by Gebhard and Sagan, we establish the $e$-positivity of a class of graphs called tadpole graphs. By considering the twinning operation on a subclass of these graphs with respect to certain vertices we disprove the latter conjecture of Foley, Ho\`{a}ng and Merkel. We further show that if $G$ is $e$-positive, the twin graph $G_v$ and more generally the clan graphs $G^{(k)}_v$ ($k \ge 1$) may not even be $s$-positive, where $G^{(k)}_v$ is obtained from $G$ by applying $k$ twinning operations to $v$., Comment: 20 pages, 17 figures

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak and descent statistics over ballot permutations, and connect this distribution and the joint distribution (pk, dp, des) of the peak, depth, and descent statistics over ordinary permutations in terms of generating functions. As corollaries, we obtain several formulas for the bivariate generating function for (i) the peak statistic over ballot permutations,(ii) the descent statistic over ballot permutations, and (iii) the depth statistic over ordinary permutations. In particular, we confirm Spiro's conjecture which finds the equidistribution of the descent statistic for ballot permutations and an analogue of the descent statistic for odd order permutations., Comment: 16 pages

It is known that the problem of computing the edge dimension of a graph is NP-hard, and that the edge dimension of any generalized Petersen graph $P(n,k)$ is at least 3. We prove that the graph $P(n,3)$ has edge dimension 4 for $n\ge 11$, by showing semi-combinatorially the nonexistence of an edge resolving set of order 3 and by constructing explicitly an edge resolving set of order 4., Comment: 28 pages, 1 figure, 21 tables

Since the PointNet was proposed, deep learning on point cloud has been the concentration of intense 3D research. However, existing point-based methods usually are not adequate to extract the local features and the spatial pattern of a point cloud for further shape understanding. This paper presents an end-to-end framework, SK-Net, to jointly optimize the inference of spatial keypoint with the learning of feature representation of a point cloud for a specific point cloud task. One key process of SK-Net is the generation of spatial keypoints (Skeypoints). It is jointly conducted by two proposed regulating losses and a task objective function without knowledge of Skeypoint location annotations and proposals. Specifically, our Skeypoints are not sensitive to the location consistency but are acutely aware of shape. Another key process of SK-Net is the extraction of the local structure of Skeypoints (detail feature) and the local spatial pattern of normalized Skeypoints (pattern feature). This process generates a comprehensive representation, pattern-detail (PD) feature, which comprises the local detail information of a point cloud and reveals its spatial pattern through the part district reconstruction on normalized Skeypoints. Consequently, our network is prompted to effectively understand the correlation between different regions of a point cloud and integrate contextual information of the point cloud. In point cloud tasks, such as classification and segmentation, our proposed method performs better than or comparable with the state-of-the-art approaches. We also present an ablation study to demonstrate the advantages of SK-Net.

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of an arc, a circle, an interval or its exterior under the real line, the union of at most two different shapes of the above cases expect the union of an arc and a circle, and some degenerate forms., Comment: 14 pages, 1 figure

We give a new semi-combinatorial proof for the equality of the number of ballot permutations of length $n$ and the number of odd order permutations of length $n$, which is due to Bernardi, Duplantier and Nadeau. Spiro conjectures that the descent number of ballot permutations and certain cyclic weight of odd order permutations of the same length are equi-distributed. We present a bijection to establish a Toeplitz property for ballot permutations with any fixed number of descents, and a Toeplitz property for odd order permutations with any fixed cyclic weight. This allows us to refine Spiro's conjecture by tracking the neighbors of the largest letter in permutations., Comment: 12 pages

We provide a formula for every Schur coefficient in the chromatic symmetric function of a graph in terms of special rim hook tabloids. This formula is useful in confirming the non-Schur positivity of the chromatic symmetric function of a graph, especially when Stanley's stable partition method does not work. As applications, we determine Schur positive fan graphs and Schur positive complete tripartite graphs. We show that any squid graph obtained by adding $n$ leaves to a common vertex on an $m$-vertex cycle is not Schur positive if $m\ne 2n-1$, and conjecture that neither are the squid graphs with $m=2n-1$., Comment: 12 pages, 5 figures

Measuring the directional distribution of ocean waves is a difficult task in ocean wave research. For many decades, wind-generated waves are assumed to propagate primarily in the wind direction. The concept is applied either implicitly or explicitly in the formulation of the wind input function and the design of the wave directional distribution function. Photographs of the ocean surface wave fields under steady wind forcing, however, display very different directional properties. In the near shore region, the surface undulations are dominantly crosswind. As the fetch increases, the geometry of surface waves is crosshatched, indicating two dominant wave trains crossing each other. This pattern of wave propagation in off-wind directions is repeatedly photographed in different locations under different offshore (toward) wind events. The wavelengths of these airborne photographs are in the deca-meter length scale. Shorter waves with wavelengths ranging from a few centimeters to a few decimeters also show crosshatched patterns, based on pictures taken from land and ship. In the crosshatched cases, most pictures show that the wind vector bisecting the diamond shape of the surface wave geometry. The observed wave geometries and their fetch evolution expose a major flaw in our fundamental assumption (implicitly or explicitly) that "wind-generated waves propagate primarily in the wind direction." The assumption has been taken for granted for many decades in applications including basic research of wave dynamics and the design of directional wave spectral model for calculations of the ocean surface roughness and the force, energy, and momentum of a wave field.

Over the years, the directional distribution functions of wind-generated wave field have been assumed to be unimodal. While details of various functional forms differ, these directional models suggest that waves of all spectral components propagate primarily in the wind direction. The beamwidth of the directional distribution is narrowest near the spectral peak frequency, and increases toward both higher and lower frequencies. Recent advances in global positioning, laser ranging and computer technologies have made it possible to acquire high-resolution 3D topography of ocean surface waves. Directional spectral analysis of the ocean surface topography clearly shows that in a young wave field, two dominant wave systems travel at oblique angles to the wind and the ocean surface display a crosshatched pattern. One possible mechanism generating this bimodal directional wave field is resonant propagation as suggested by Phillips resonance theory of wind wave generation. For a more mature wave field, wave components shorter than the peak wavelength also show bimodal directional distributions symmetric to the dominant wave direction. The latter bimodal directionality is produced by Hasselmann nonlinear wave-wave interaction mechanism. The implications of these directional observations on remote sensing (directional characteristics of ocean surface roughness) and air-sea interaction studies (directional properties of mass, momentum and energy transfers) are significant.

In planning and scheduling, solving problems with both state and temporal constraints is hard since these constraints may be highly coupled. Judicious orderings of events enable solvers to efficiently make decisions over sequences of actions to satisfy complex hybrid specifications. The ordering problem is thus fundamental to planning. Promising recent works have explored the ordering problem as search, incorporating a special tree structure for efficiency. However, such approaches only reason over partial order specifications. Having observed that an ordering is inconsistent with respect to underlying constraints, prior works do not exploit the tree structure to efficiently generate orderings that resolve the inconsistency. In this paper, we present Conflict-directed Incremental Total Ordering (CDITO), a conflict-directed search method to incrementally and systematically generate event total orders given ordering relations and conflicts returned by sub-solvers. Due to its ability to reason over conflicts, CDITO is much more efficient than Incremental Total Ordering. We demonstrate this by benchmarking on temporal network configuration problems that involve routing network flows and allocating bandwidth resources over time., Comment: Accepted at ICAPS2019. 9 pages, 4 figures, 2 tables

The path toward Li-ion batteries with higher energy-densities will likely involve use of thin lithium metal (Li) anode (<50 $\mu$m in thickness), whose cyclability today remains limited by dendrite formation and low Coulombic efficiency. Previous studies have shown that the solid-electrolyte-interface (SEI) of Li metal plays a crucial role in Li electrodeposition and stripping. However, design rules for optimal SEIs on lithium metal are not well-established. Here, using integrated experimental and modeling studies on a series of structurally-similar SEI-modifying compounds as model systems, we reveal the relationship between SEI compositions, Li deposition morphology and coulombic efficiency, and identify two key descriptors (ionicity and compactness) for high performance SEIs through integrated experimental and modeling studies. Using this understanding, we design a highly ionic and compact SEI that shows excellent cycling performance in LiCoO$_2$-Li full cells at practical current densities. Our results provide guidance for the rational selection and optimization of SEI modifiers to further improve Li metal anodes., Comment: 21 pages, 6 figures and Supplementary Information

When operating in unstructured environments such as warehouses, homes, and retail centers, robots are frequently required to interactively search for and retrieve specific objects from cluttered bins, shelves, or tables. Mechanical Search describes the class of tasks where the goal is to locate and extract a known target object. In this paper, we formalize Mechanical Search and study a version where distractor objects are heaped over the target object in a bin. The robot uses an RGBD perception system and control policies to iteratively select, parameterize, and perform one of 3 actions -- push, suction, grasp -- until the target object is extracted, or either a time limit is exceeded, or no high confidence push or grasp is available. We present a study of 5 algorithmic policies for mechanical search, with 15,000 simulated trials and 300 physical trials for heaps ranging from 10 to 20 objects. Results suggest that success can be achieved in this long-horizon task with algorithmic policies in over 95% of instances and that the number of actions required scales approximately linearly with the size of the heap. Code and supplementary material can be found at http://ai.stanford.edu/mech-search ., Comment: To appear in IEEE International Conference on Robotics and Automation (ICRA), 2019. 9 pages with 4 figures

We find a combinatorial interpretation of Shareshian and Wachs' $q$-binomial-Eulerian polynomials, which leads to an alternative proof of their $q$-$\gamma$-positivity using group actions. Motivated by the sign-balance identity of D\'esarm\'enien--Foata--Loday for the $(\mathrm{des}, \mathrm{inv})$-Eulerian polynomials, we further investigate the sign-balance of the $q$-binomial-Eulerian polynomials. We show the unimodality of the resulting signed binomial-Eulerian polynomials by exploiting their continued fraction expansion and making use of a new quadratic recursion for the $q$-binomial-Eulerian polynomials. We finally use the method of continued fractions to derive a new $(p,q)$-extension of the $\gamma$-positivity of binomial-Eulerian polynomials which involves crossings and nestings of permutations., Comment: 19 pages (without Sections 5,6 of the previous version)

Let $G$ be a connected general graph of even order, with a function $f\colon V(G)\to\Z^+$. We obtain that $G$ satisfies the Tutte's condition \[ o(G-S)\le \sum_{v\in S}f(v)\qquad\text{for any nonempty set $S\subset V(G)$}, \] with respect to $f$ if and only if $G$ contains an $H$-factor for any function $H\colon V(G)\to 2^\N$ such that $H(v)\in \{J_f(v),\,J_f^+(v)\}$ for each $v\in V(G)$, where the set $J_f(v)$ consists of the integer $f(v)$ and all positive odd integers less than $f(v)$, and the set $J^+_f(v)$ consists of positive odd integers less than or equal to $f(v)+1$. We also obtain a characterization for graphs of odd order satisfying the Tutte's condition with respect to a function., Comment: 5 pages

In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc, or a circle, or a "lollipop", or an interval. As an application, we discover a sufficient and necessary condition for the universal real-rootedness of the polynomials, subject to certain sign condition on the coefficients of the recurrence. Moreover, we obtain the sharp bound for all the zeros when they are real., Comment: 14 pages, 1 figure

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the overall real-rootedness of all the polynomials, in terms of the polynomial coefficients of the recurrence. Moreover, in the real-rooted case, we find the set of limits of zeros, which turns out to be the union of a closed interval and one or two isolated points; when non-real-rooted polynomial exists, we present a sufficient condition under which every polynomial with $n$ large has a real zero., Comment: 14page, 3 figures

We give a characterization of common zeros of a sequence of univariate polynomials $W_n(z)$ defined by a recurrence of order two with polynomial coefficients, and with $W_0(z)=1$. Real common zeros for such polynomials with real coefficients are studied further. This paper contributes to the study of root distribution of recursive polynomial sequences., Comment: 12 pages

We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly speaking, one constructs a collection of disjoint intervals such that one may show by induction that consecutive polynomials have interlacing zeros over each of the intervals. We confirm the real-rootedness of some polynomials satisfying a recurrence with linear polynomial coefficients. This extends Gross et al.'s work where one of the polynomial coefficients is a constant., Comment: 18 pages, 6 figures

Let $p$ be a prime. In this short note we study some families of super congruences involving the following alternating sums \begin{equation*} \sum_{\substack{j_1+j_2+\cdots+j_n=2 p^r p\nmid j_1 j_2 \cdots j_n}} \frac{(-1)^{j_1+\cdots+j_b}}{j_1\cdots j_n} \pmod{p^r}, \end{equation*} which extend similar statements proved by Shen and Cai who treated the cases when $n=4,5$., Comment: 10 pages, Acta Arithmetica, 2018

Let $G$ be a connected general graph. Let $f\colon V(G)\to \Z^+$ be a function. We show that $G$ satisfies the Tutte-type condition \[ o(G-S)\le f(S)\qquad\text{for all vertex subsets $S$}, \] if and only if it contains a colored $J_f^*$-factor for any $2$-end-coloring, where $J_f^*(v)$ is the union of all odd integers smaller than $f(v)$ and the integer $f(v)$ itself. This is a generalization of the $(1,f)$-odd factor characterization theorem, and answers a problem of Cui and Kano. We also derive an analogous characterization for graphs of odd orders, which addresses a problem of Akiyama and Kano., Comment: 12 pages

Recently, Gross et al. posed the LLC conjecture for the locally log-concavity of the genus distribution of every graph, and provided an equivalent combinatorial version, the CLLC conjecture, on the log-concavity of the generating function counting cycles of some permutation compositions. In this paper, we confirm the CLLC conjecture for cyclic permutations, with the aid of Hultman numbers and by applying the Hermite--Biehler theorem on the generating function of Stirling numbers of the first kind. This leads to a further conjecture that every local genus polynomial is real-rooted., Comment: 12 pages

Let $n\ge 34$ be an even integer, and $D_n=2\lceil n/4 \rceil-1$. In this paper, we prove that every $\{D_n,\,D_n+1\}$-graph of order $n$ contains $\lceil n/4 \rceil$ disjoint perfect matchings. This result is sharp in the sense that (i) there exists a $\{D_n,\,D_n+1\}$-graph containing exactly $\lceil n/4 \rceil$ disjoint perfect matchings, and that (ii) there exists a $\{D_n-1,\,D_n\}$-graph without perfect matchings for each $n$. As a consequence, for any integer $D\ge D_n$, every $\{D,\,D+1\}$-graph of order $n$ contains $\lceil (D+1)/2 \rceil$ disjoint perfect matchings. This extends Csaba et~al.'s breathe-taking result that every $D$-regular graph of sufficiently large order is $1$-factorizable, generalizes Zhang and Zhu's result that every $D_n$-regular graph of order $n$ contains $\lceil n/4 \rceil$ disjoint perfect matchings, and improves Hou's result that for all $k\ge n/2$, every $\{k,\,k+1\}$-graph of order $n$ contains $(\lfloor n/3\rfloor+1+k-n/2)$ disjoint perfect matchings., Comment: 30 pages, 9 figures

In a recent proof of the log-concavity of genus polynomials of some families of graphs, Gross et al. defined the weakly synchronicity relation between log-concave sequences, and conjectured that the convolution operation by any log-concave sequence preserves weakly synchronicity. We disprove it by providing a counterexample. Furthermore, we find the so-called partial synchronicity relation between log-concave sequences, which is (i) weaker than the synchronicity, (ii) stronger than the weakly synchronicity, and (iii) preserved by the convolution operation., Comment: 13 pages

An analysis of the relative motion and point feature model configurations leading to solution degeneracy is presented, for the case of a Simultaneous Localization and Mapping system using multicamera clusters with non-overlapping fields-of-view. The SLAM optimization system seeks to minimize image space reprojection error and is formulated for a cluster containing any number of component cameras, observing any number of point features over two keyframes. The measurement Jacobian is transformed to expose a reduced-dimension representation such that the degeneracy of the system can be determined by the rank of a dense submatrix. A set of relative motions sufficient for degeneracy are identified for certain cluster configurations, independent of target model geometry. Furthermore, it is shown that increasing the number of cameras within the cluster and observing features across different cameras over the two keyframes reduces the size of the degenerate motion sets significantly., Comment: 18 pages, 18 figures

We show that under the matrix product state formalism the states produced in Shor's algorithm can be represented using O(max($4lr^2$, $2^{2l}$)) space, where l is the number of bits in the number to factorise, and r is the order and the solution to the related order-finding problem. The reduction in space compared to an amplitude formalism approach is significant, allowing simulations as large as 42 qubits to be run on a single processor with 32GB RAM. This approach is readily adapted to a distributed memory environment, and we have simulated a 45 qubit case using 8 cores with 16GB RAM in approximately one hour., Comment: 7 pages, 4 tables, 4 figures

We find the minimum number $k=\mu'(\Sigma)$ for any surface $\Sigma$, such that every $\Sigma$-embeddable non-bipartite graph is not $k$-extendable. In particular, we construct the so-called bow-tie graphs $C_6\bowtie P_n$, and show that they are $3$-extendable. This confirms the existence of an infinite number of $3$-extendable non-bipartite graphs which can be embedded in the Klein bottle., Comment: 17 pages, 5 figures

Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the exact formulas for the expectation and variance of the number of non-zero-blocks in a random colored $B_n$-partition. We find an asymptotic expression of the total number of colored $B_n$-partitions up to an error of $O(n^{-1/2}\log^{7/2}{n})$, and prove that the centralized and normalized number of non-zero-blocks is asymptotic normal over colored $B_n$-partitions., Comment: 10 pages

We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method., Comment: 18 pages

This paper is concerned with the surface embedding of matching extendable graphs. There are two directions extending the theory of perfect matchings, that is, matching extendability and factor-criticality. In solving a problem posed by Plummer, Dean (The matching extendability of surfaces, J. Combin. Theory Ser. B 54 (1992), 133--141) established the fascinating formula for the minimum number $k= \mu (\Sigma) $ such that every $\Sigma$-embeddable graph is not $k$-extendable. Su and Zhang, Plummer and Zha found the minimum number $n=\rho(\Sigma)$ such that every $\Sigma$-embeddable graph is not $n$-factor-critical. Based on the notion of $(n,k)$-graphs which associates these two parameters, we found the formula for the minimum number $k=\mu(n,\Sigma)$ such that every $\Sigma$-embeddable graph is not an $(n,k)$-graph. To access this two-parameter-problem, we consider its dual problem and find out $\mu(n,\Sigma)$ conversely. The same approach works for rediscovering the formula of the number $\rho(\Sigma)$., Comment: 17 pages