Generic groups satisfy a chain condition for subgroups.
problem Understanding subgroup structures in generic groups.
method Proving for fixed integers m,t,k in generic m-generator t-relator groups. result Generic groups satisfy the Ascending Chain Condition for k-generated subgroups. The paper proves an ascending chain condition for subgroups in hyperbolic and graph 3-manifolds.
problem Proving an ascending chain condition for subgroups in specific types of 3-manifolds.
method Uses profinite techniques and geometric proofs for hyperbolic and graph manifolds.
result Established the ascending chain condition for free subgroups of constant rank in closed hyperbolic and graph 3-manifolds.
The study proves stabilizing of ascending chains in specific groups.
problem Stabilization of ascending chains in bounded rank subgroups of 3-manifold groups.
method Reduction to hyperbolic 3-manifolds and use of geometrization.
result Ascending chains in toral relatively hyperbolic groups stabilize.
No hyperbolic group can have an infinite chain of free subgroups of fixed rank.
problem Infinite ascending chains of free subgroups in hyperbolic groups.
method Proof by contradiction and properties of hyperbolic groups.
result Hyperbolic groups do not contain strictly ascending chains of free quasiconvex subgroups of constant rank.
ASCEND discovers causal relationships in multi-omics data by leveraging known hierarchical structure.
problem Causal inference in high-dimensional multi-omics data, especially when ignoring the hierarchical structure.
method Two-tiered divide-and-conquer strategy with ancestral conditioning sets.
result Achieves polynomial-time complexity and accurately recovers ancestral relationships.
New manifolds help understand group actions on complex chains.
problem Understanding compact Lie group actions on Morse and Floer chains.
method Introduced new manifolds called forest biassociahedra and bimultiplihedra.
result Derived algebraic structures like bialgebras and bimodules.
Positive braids minimize knot untangling steps.
problem Finding the minimum number of steps to untangle knots.
method Analyzing positive braids and their knot closures, comparing ascending number to unknotting number.
result Ascending number equals unknotting number for knots from positive braids.
Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at most 10 crossings, for which the unknotting number can be confirmed by using th…
Hyperbolicity proven for a specific type of group extension.
problem Proving hyperbolicity of a specific group extension.
method Analyzing ascending HNN extension of groups with a free factor system and an injective endomorphism.
result Ascending HNN extension of a group is hyperbolic relative to a collection of maximal parabolic subgroups.
We obtain several restrictions on the terms of the ascending central series of a nilpotent Lie algebra g under the presence of a complex structure J. In particular, we find a bound for the dimension of the center of g when it does not contain any non-trivial J-invariant ideal. Thanks to thes…
Robot untangles knots by walking and switching crossings.
problem Untangling knots using a robot with limited memory.
method The robot walks a knot diagram, switching crossings, and combinatorially proves knot transformations.
result Minimal moves to transform knots into an unknot are bounded by (7C+1)C.
We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.
This paper proves bi-orderability of two-bridge link groups.
problem Bi-orderability of two-bridge link groups.
method Modified graph theoretic construction of Hirasawa and Murasugi to understand Alexander subgroups.
result Bi-orderability of a large family of two-bridge link groups.
MAGE optimizes policies using action gradients from model-based learning.
problem Lack of direct gradient information from critics in actor-critic methods.
method Model-based actor-critic algorithm that learns action-value gradient.
result MAGE outperforms model-free and model-based baselines on continuous control tasks.
Transformers learn to integrate information from past positions incrementally, specializing heads in distinct patterns.
problem How transformers learn to integrate information from multiple past positions with varying statistical significance.
method High-order Markov chain task, incremental learning, sparse attention patterns, simplified differential equations, stage-wise convergence, early stopping as regularizer.
result Transformers learn to specialize heads in distinct patterns, shifting from competitive to cooperative learning dynamics.
We give an example of a subgroup of SL(2,C) which is a strictly ascending HNN extension of a non-abelian finitely generated free group F. In particular, we exhibit a free group F in SL(2,C) of rank 6 which is conjugate to a proper subgroup of itself. This answers positively a question of Drutu and Sapir. The main ingre…
The ability to analyze and forecast stratospheric weather conditions is fundamental to addressing climate change. However, our capacity to collect data in the stratosphere is limited by sparsely deployed weather balloons. We propose a framework to collect stratospheric data by releasing a contrail of tiny sensor device…
Improves multi-label classification with a new network model.
problem Improving multi-label classification accuracy.
method Introduces Classifier Chain Network (CCN) for multi-label classification.
result CCN outperforms benchmark methods in simulations and real data.
The paper extends Hoeffding's inequality for Markov chains using a generalized concentrability condition.
problem Applying Hoeffding's inequality to non-ergodic Markov chains.
method Integrates generalized concentrability condition via IPM to extend traditional hypotheses.
result Demonstrates utility in machine learning applications such as empirical risk minimization and bandits.
Unified Morse-Bott-Smale chain complex, resolves well-definedness issue.
problem Well-definedness of Morse-Bott-Smale chain complex.
method Unified five degeneracy relations into a single condition.
result Quasi-isomorphic to Morse-Smale-Witten chain complex, alternative proof of Morse Homology Theorem.
Hidden Markov Chains and Linear-chain CRFs are equivalent.
problem Comparing Hidden Markov Chains and Conditional Random Fields.
method Constructing an HMC with the same posterior distribution as a CRF.
result HMCs and linear-chain CRFs are equivalent models.
Paper solves isomorphism problem for specific Baumslag-Solitar groups.
problem Isomorphism problem for small rose non-ascending generalized Baumslag-Solitar groups.
method Analyzed group actions on trees with specific stabilizers.
result Isomorphism problem solvable for the specified groups.
Mack's estimator improves chain ladder prediction for large exposure insurance models.
problem Uncertainty quantification in compound Poisson loss models.
method Large exposure asymptotics applied to Mack's estimator.
result Chain ladder prediction uncertainty can be quantified without model assumptions.
Study on identifying AMP chain graph models under known and unknown component decompositions.
problem Identifying AMP chain graph models with known and unknown chain component decompositions.
method Analyzes conditions for identifiability of AMP models and proposes algorithms for structure recovery.
result Conditions for DAG identifiability in AMP models extend equal variance criteria for Bayes nets.
The study establishes a curvature-dimension condition for discrete Markov chains.
problem Proving modified logarithmic Sobolev inequalities for discrete Markov chains.
method Identifying and proving a curvature-dimension inequality CDΥ(κ,∞), and showing its compatibility with diffusive settings. result The CDΥ condition preserves curvature bounds under tensorization and leads to Beckner inequalities. Determinant modulo 8 classifies virtual knots based on polynomial coefficients.
problem Classifying virtual knots using determinant modulo 8.
method Introduced a determinant for checkerboard colorable virtual knots and proved its classification by the coefficient of z2 in the ascending polynomial. result Determinant modulo 8 classifies virtual knots based on polynomial coefficients.
PL-MCMC samples from normalizing flows' conditional distributions.
problem Sampling from complex conditional distributions learned by normalizing flows.
method Metropolis-Hastings implementation of PL-MCMC.
result PL-MCMC asymptotically samples from exact conditional distributions.
Study improves loan default risk estimation using advanced regression models.
problem Modeling loan default risk over time is challenging and affects financial reserves.
method Comparative study of three multistate regression techniques: Markov chain, beta regression, and multinomial logistic regression.
result Each successive model outperforms the previous, indicating greater sophistication.
Paper presents a new flat triangular form for systems.
problem Creating a structurally flat triangular form for systems.
method Developed a new triangular form based on the extended chained form with conditions for static feedback equivalence.
result Provided conditions for affine input systems to be static feedback equivalent to the new triangular form.
The article examines entropy-information inequalities for continuous-time Markov chains under curvature-dimension conditions.
problem Proving Li-Yau inequalities and modified logarithmic Sobolev inequalities for reversible Markov chains.
method Introducing the CDΥ(κ,F) condition and deriving entropy-information inequalities. result Derives functional inequalities relating entropy to Fisher information.
In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion un…
The uniform boundary condition in a normed chain complex asks for a uniform linear bound on fillings of null-homologous cycles. For the ℓ1-norm on the singular chain complex, Matsumoto and Morita established a characterisation of the uniform boundary condition in terms of bounded cohomology. In particular, spaces…
Characterizes chains in 3D CR and para-CR structures.
problem Determining when a 3D path geometry comes from CR or para-CR chains.
method Provides necessary and sufficient conditions for a 3D path geometry to arise from chains of CR or para-CR 3-manifolds, and verifies computationally.
result Characterization of chains in 3D CR and para-CR structures.
We prove (without using Federer's structure theorem) that a finite-mass flat chain over any coefficient group is rectifiable if and only if almost all of its 0-dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a simple necessary and su…
We systematically investigate the problem of representing Markov chains by families of random maps, and which regularity of these maps can be achieved depending on the properties of the probability measures. Our key idea is to use techniques from optimal transport to select optimal such maps. Optimal transport theory a…
The paper tackles learning from non-irreducible Markov chains, proving learnability and generalization bounds.
problem Learning from temporal dependent data with non-irreducible Markov chains.
method Uniform convergence and generalization bounds for sample error under uniform ergodicity.
result Learnability and generalization bounds for approximate sample error minimization algorithm.
In this paper, we introduce the notion of Reidemeister torsion for quasi-isomorphisms of based chain complexes over a field. We call a chain map a quasi-isomorphism if its induced homomorphism between homology is an isomorphism. Our notion of torsion generalizes the torsion of acyclic based chain complexes, and is a ch…
We give chain homotopy maps of Khovanov-type link homology of a universal differential. The universal differential, discussed by Mikhail Khovanov, Marco Mackaay, Paul Turner and Pedro Vaz, contains the original Khovanov's differential and Lee's differential. We also consider the conditions of any differential ensuring …
A theorem simplifies mass-minimizing flat chains' regularity.
problem Understanding the regularity of mass-minimizing flat chains.
method Simple condition for fundamental regularity principle.
result Fundamental regularity principle holds for mass-minimizing chains.
The paper establishes CLTs for Markov chains and improves sampling algorithms for heavy-tailed distributions.
problem Establishing central limit theorems for ergodic averages of Markov chains.
method Drift conditions to provide necessary and sufficient conditions for CLTs, including lower bounds on convergence rates.
result Sharp conditions and convergence rates for various MCMC algorithms on heavy-tailed targets.
We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…
It seems to be a pearl of conventional wisdom that parameter learning in deep sum-product networks is surprisingly fast compared to shallow mixture models. This paper examines the effects of overparameterization in sum-product networks on the speed of parameter optimisation. Using theoretical analysis and empirical exp…
We propose a novel framework of estimating systemic risk measures and risk allocations based on Markov chain Monte Carlo (MCMC) methods. We consider a class of allocations whose jth component can be written as some risk measure of the jth conditional marginal loss distribution given the so-called crisis event. By consi…
Classifier chains are popular and effective method to tackle a multi-label classification problem. The aim of this paper is to study the asymptotic properties of the chain model in which the conditional probabilities are of the logistic form. In particular we find conditions on the number of labels and the distribution…
Researchers determine the Thurston unit ball for a family of n-chained links and find conditions for fibered faces.
problem Determining the Thurston unit ball and conditions for fibered faces in a family of n-chained links. method Analyzing the family of n-chained links C(n,p), proving the Thurston unit ball is an n-dimensional cocube for p>0, and finding conditions for fibered faces. result The Thurston unit ball for C(n,p) is an n-dimensional cocube for p>0 and provides at least one fibered face for any p. In this paper it is shown that a CR embedding from one strictly pseudoconvex hypersurface into another (of strictly larger dimension) sends chains on the source to chains on the target if and only if the embedding has a lift to a conformal isometry of the associated Fefferman bundles with vanishing pseudo-Riemannian se…
We define the local periodic linking number, LK, between two oriented closed or open chains in a system with three-dimensional periodic boundary conditions. The properties of LK indicate that it is an appropriate measure of entanglement between a collection of chains in a periodic system. Using this measure of linking …
New techniques in Khovanov homology help distinguish exotic surfaces in 4-ball.
problem Distinguishing exotic surfaces in the 4-ball that are not diffeomorphic.
method Developed new techniques for distinguishing cobordism maps on Khovanov homology using knot symmetries and braid factorizations.
result Distinguishes smooth surfaces in the 4-ball that are exotically knotted.