Ribbon cobordism forms a partial order in 3-manifolds.
problem Understanding partial orders in 3-manifolds.
method Utilizing recent methods from Ian Agol's work on knot concordance.
result Ribbon rational homology cobordism forms a partial order.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “partial-ordering”
Ribbon cobordisms form a partial order on 3-manifolds.
problem Understanding the partial order structure of 3-manifolds.
method Building on Agol's proof for knots, we extend the partial order to 3-manifolds.
result Ribbon rational homology cobordism forms a partial order.
Prove strong ribbon concordance induces a partial order on links, certify minimality for a handful of knots, and find minimal ribbon minimal knots.
problem Prove strong ribbon concordance induces a partial order on links.
method Use results from knot Floer homology to certify minimality under the ribbon partial order.
result Certify minimality for a handful of knots and find minimal ribbon minimal knots.
Rational homology ribbon cobordism defines a partial order on 3-manifolds.
problem Classifying 3-manifolds based on their homology
method Proving a partial order on homeomorphism classes of 3-manifolds
result Closed, connected, oriented 3-manifolds are partially ordered by rational homology ribbon cobordism.
In this paper, we introduce a partial order on neighborhood equivalence classes of maximally spread essential multibranched surfaces embedded in a 3-manifold. We show that if a maximally spread essential multibranched surface is atoroidal and acylindrical, then its equivalence class is minimal with respect to the parti…
Differentiable relaxation for inferring partial orders from noisy linear data.
problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.
Algorithm improves reinforcement learning in MDPs with partial order policies.
problem Improving reinforcement learning in MDPs with partial order policies.
method Epoch-based reinforcement learning algorithm leveraging a partial order over policy class.
result Achieves an regret bound, independent of state and action space sizes.
New depth function for partial orders helps compare machine learning algorithms.
problem Comparing machine learning algorithms using non-standard data types.
method Adapted simplicial depth to partial orders, using ufg depth for comparison.
result Demonstrates promising variety of analysis approaches based on ufg methods.
Hierarchical Partial-Order Models for Ranking
problem Rank aggregation combining ordered lists
method Hierarchical partial-order models
result Bayesian inference for latent poset hierarchy
We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We…
Paper proposes methods to learn DAGs from partial orderings.
problem Learning DAGs from partial orderings is challenging.
method General estimation framework and efficient algorithms for low- and high-dimensional problems.
result Efficient estimation of DAGs from partial orderings is possible.
The paper uses belief propagation to analyze rankings and partial orders from partial information.
problem Analyzing rankings and partial orders from incomplete data.
method Continuous spin system and belief propagation algorithm.
result Computes marginal distribution and approximates number of linear extensions.
We say that a link is an s-major of a link if any diagram of can be transformed into a diagram of by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knot…
We give a survey of some recent papers by the authors and Masaaki Wada relating the twisted Alexander polynomial with a partial order on the set of prime knots. We also give examples and pose open problems.
New statistical models for predicting ranked preferences from partial orders.
problem Statistical models overlook information in list length.
method Composite and augmented ranking models for joint modeling of partial orders and list lengths.
result Augmented ranking models best predict both length and preferences.
A novel transformer model improves classification of partially ordered sequences.
problem Classification of partially ordered sequences with uncertainty in timestamps.
method Developed a transformer-based model for partially ordered sequences, benchmarked against set models.
result Transformer-based model outperforms set models on three datasets.
It is well known that a countable group admits a left-invariant total order if and only if it acts faithfully on R by orientation preserving homeomorphisms. Such group actions are special cases of group actions on simply connected 1-manifolds, or equivalently, actions on oriented order trees. We characterize a class of…
As in [5], we study holomorphic maps of positive degree between compact complex manifolds, and prove that any holomorphic map of degree one from a compact complex manifold to itself is biholomorphic. This conclusion confirms that under a mild restriction the holomorphic Gromov relation ">_" is indeed a partial order.
The natural partial ordering of the orbit types of the action of the group of local gauge transformations on the space of connections in space-time dimension d<=4 is investigated. For that purpose, a description of orbit types in terms of cohomology elements of space-time, derived earlier, is used. It is shown that, on…
A partial order on the set of prime knots can be defined by the existence of an epimorphism between knot groups. We prove that all the prime knots with up to crossings are minimal. We also show that each fibered knot with the irreducible Alexander polynomial is minimal.
In this paper we use continued fractions to study a partial order on the set of 2-bridge knots derived from the work of Ohtsuki, Riley, and Sakuma. We establish necessary and sufficient conditions for any set of 2-bridge knots to have an upper bound with respect to the partial order. Moreover, given any 2-bridge knot K…
Li-York theorem tells us that a period 3 orbit for a continuous map of the interval into itself implies the existence of a periodic orbit of every period. This paper concerns an analogue of the theorem for homeomorphisms of the 2-dimensional disk. In this case a periodic orbit is specified by a braid type and on the se…
We prove, for a class of contact manifolds, that the universal cover of the group of contact diffeomorphisms carries a natural partial order. It leads to a new viewpoint on geometry and dynamics of contactomorphisms. It gives rise to invariants of contactomorphisms which generalize the classical notion of the rotation …
Study immersions of punctured 4-manifolds for quantum automata applications.
problem Existence of immersions between specific 4-manifolds.
method Analyzing immersions of punctured 4-manifolds to establish a partial order.
result Established a partial order on closed 4-manifolds via immersions.
Knots can be ordered by ribbon concordance, solving a long-standing question.
problem Ordering knots by ribbon concordance.
method Representation varieties of knot groups to and relations induced by ribbon concordance.
result Ribbon concordance forms a partial ordering on the set of knots.
The paper proves tight fibered knots are minimal in a specific knot order.
problem Understanding the minimality of tight fibered knots.
method Proved ribbon concordance forms a partial order and used it to show tight fibered knots are minimal.
result All tight fibered knots are minimal in the ribbon concordance order.
Estimation, Prediction, and Assortment Optimization for Markov Chain Choice Models with Panel Datacs.LG
Proposes new methods for Markov chain choice models with panel data.
problem Dependence among transactions for the same customer in historical data.
method Expectation-maximization (EM) algorithms incorporating partial-ordering preference information.
result EM algorithms outperform traditional methods on synthetic and real datasets.
Mixtures of ranking models have been widely used for heterogeneous preferences. However, learning a mixture model is highly nontrivial, especially when the dataset consists of partial orders. In such cases, the parameter of the model may not be even identifiable. In this paper, we focus on three popular structures of p…
We show that all twist knots, certain double twist knots and some other 2-bridge knots are minimal elements for the partial ordering on the set of prime knots. The key to these results are presentations of their character varieties using Chebyshev polynomials and a criterion for irreducibility of a polynomial of two va…
Framework benchmarks optimizers on multiple criteria.
problem Benchmarking optimizers across diverse test functions.
method Union-free generic depth function for partial orders/rankings.
result Identifies central and outlying rankings of optimizers.
It is shown that if is a strongly causal free of naked singularities space-time, then its causal structure is completely characterized by a partial order in the space of skies defined by means of a class non-negative Legendrian isotopies. It is also proved that such partial order is determined by the class of futur…
Strict partial order is a mathematical structure commonly seen in relational data. One obstacle to extracting such type of relations at scale is the lack of large-scale labels for building effective data-driven solutions. We develop an active learning framework for mining such relations subject to a strict order. Our a…
Recent work in learning ontologies (hierarchical and partially-ordered structures) has leveraged the intrinsic geometry of spaces of learned representations to make predictions that automatically obey complex structural constraints. We explore two extensions of one such model, the order-embedding model for hierarchical…
Let be a prime knot in and the knot group. We write if there exists a surjective homomorphism from onto . In this paper, we determine this partial order on the set of prime knots with up to 11 crossings. There exist such 801 prime knots and then shou…
The paper shows how to find inaccessible hyperbolic actions in manifold groups.
problem Finding hyperbolic actions of 3-manifold groups that are inaccessible.
method Analyzing the partial order of cobounded actions on hyperbolic spaces.
result Proves the existence of finite covers with inaccessible fundamental groups.
Extracts geometric information from point-clouds for multiclass classification.
problem Multiclass Classification with labeled point-clouds.
method Stochastic partial orderings and label embedding trees.
result Computes multiscale geometries for explainable prediction and error-free labeling.
Knot Group Epimorphismsmath.GT
Any knot group is the image of the group of a prime knot by a homomorphism that preserves peripheral structure. In fact, there are infinitely many such prime knots. A related partial order on knots is defined, and its properties are discussed.
We study in this paper the remnants of the contact partial order on the orbits of the adjoint action of contactomorphism groups on their Lie algebras. Our main interest is a class of non-compact contact manifolds, called convex at infinity.
In this note we establish some appropriate conditions for stochastic equality of two random variables/vectors which are ordered with respect to convex ordering or with respect to supermodular ordering. Multivariate extensions of this result are also considered.
PARD generates graphs efficiently and invariantly to node ordering.
problem Graph generation sensitivity to node ordering.
method Integrates autoregressive and diffusion models with a partial order for nodes and edges.
result PARD achieves state-of-the-art performance on molecular and non-molecular datasets.
Homotopy equivalent boundaries of cube complexes are studied.
problem The equivalence of different boundaries of cube complexes.
method Using a partial order on a quotient of the Roller boundary, we obtain the simplicial Roller boundary and show homotopy equivalence among the Tits, simplicial, and simplicial Roller boundaries.
result The Tits, simplicial, and simplicial Roller boundaries are homotopy equivalent.
Characterizes causal structure dominance for latent variables.
problem Determining dominance relations between causal structures with latent variables.
method Complete characterization for three visible variables, partial for four; uses nontrivial inequality constraints.
result Equivalence classes with nontrivial inequality constraints become ubiquitous as the number of visible variables increases.
Study simplicial volume of manifolds from reflection group trick.
problem Characterize manifolds with positive simplicial volume.
method Define a partial order on triangulations and solve explicitly for minimal elements.
result Explicitly solved triangulations of the two-dimensional sphere and performed extensive analysis for three-dimensional case.
We study singular hyperkahler quotients of the cotangent bundle of a complex semisimple Lie group as stratified spaces whose strata are hyperkahler. We focus on one particular case where the stratification satisfies the frontier condition and the partial order on the set of strata can be described explicitly by Lie the…
We show that a map between complex-analytic manifolds, at least one of which is in the Fujiki class, is a biholomorphism under a natural condition on the second cohomologies. We use this to establish that, with mild restrictions, a certain relation of "domination" introduced by Gromov is in fact a partial order.
The paper tackles causal disentanglement with linear models and interventions.
problem Identify latent variables in a causal model from observed data.
method Use linear transformations and interventions to uniquely identify latent variables.
result A single intervention on each latent variable is sufficient for identifying the latent causal model.
We consider contact elements in the sutured Floer homology of solid tori with longitudinal sutures, as part of the (1+1)-dimensional topological quantum field theory defined by Honda--Kazez--Matić in \cite{HKM08}. The of these solid tori forms a "categorification of Pascal's triangle", and contact structur…
Regarding the Specht modules associated to the two-row partition , we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the -web basis (i.e. cup diagrams), and prove that the entries in this matrix are positive in the upper-triangular portion with respect to a ce…