Paper tackles CC generation for metrics in GR.
problem Finding CC for metrics in GR.
method Homological snake lemma approach.
result Link between CC, formal exactness, and FI.
Study reveals CR structure of snake robot's geometry.
problem Understanding the kinematics and geometry of a snake robot.
method Analysis of (2,3,5) distributions and solving Cartan equivalence problem.
result Discovery of a CR structure with CR dimension 1 and real codimension 3.
Paper studies geometric and combinatorial properties of circular snakes.
problem Exploring geometric and combinatorial properties of circular snakes.
method Definition and investigation of outer Lipschitz geometry, decomposition of Valette link, construction of combinatorial objects, weakly outer Lipschitz classification.
result Existence of canonical decomposition and necessary/sufficient criteria for removing segments or Hölder triangles.
The snake charmer algorithm permits us to deform a piecewise smooth curve starting from the origin in R^d, so that its end follows a given path. When this path is a loop, a holonomy phenomenon occurs. We prove that the holonomy orbits are closed manifolds diffeomorphic to real Stiefel manifolds. A survey of the snake c…
The purpose of this paper is to give a simpler proof to the problem of controllability of a Hilbert snake \cite{PeSa}. Using the action of the Möbius group of the unit sphere on the configuration space, in the context of a separable Hilbert space. We give a generalization of the Theorem of accessibility contained in \c…
The vision systems of the eagle and the snake outperform everything that we can make in the laboratory, but snakes and eagles cannot build an eyeglass or a telescope or a microscope. (Judea Pearl)
A new snake model improves segmentation of SEM images.
problem Efficiently segmenting overlapping electronic structures in SEM images.
method Geodesic tracking on projective line bundle with a geometric criterion for switching between fast spatial snakes and minimizing geodesics.
result Improved robust and automatic segmentation of overlapping electronic structures in SEM images.
Quantum trace map connects Teichmüller theory and quantum groups.
problem Connecting quantum groups to Teichmüller theory for knots.
method Quantum snakes technology to relate Fock-Goncharov monodromy matrices to quantum SL_n.
result Quantized Fock-Goncharov matrices satisfy quantum SL_n relations.
We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by continued fractions, and it has recently been shown that one can associate to each con…
Link Floer homology is split into snake complexes and local systems.
problem Classifying link Floer complexes over specific rings.
method Classifying isomorphism and chain homotopy equivalence classes of free chain complexes over a specific ring, then applying these results to link Floer complexes.
result Link Floer complexes split uniquely into snake complexes and local systems.
We show that the Snake on a square SC(S1) is homotopy equivalent to the space AC(S1) which was investigated in the previous work by Eda, Karimov and Repov\vs. We also introduce related constructions CSC(−) and CAC(−) and investigate homotopical differences between these four constructions. Finally, we explici…
We construct a privileged system of coordinates with respect to the controlling distribution of a trident snake robot and, furthermore, we construct a nilpotent approximation with respect to the given filtration. Note that all constructions are local in the neighbourhood of a particular point. We compare the motions co…
The paper examines addictive behaviors in RL agents using a modified Snake game.
problem The emergence of addictive behaviors in reinforcement learning agents.
method A modified Snake game was used to model addictive policies in Q-learning agents, and sufficient parametric conditions were derived for the emergence of addictive behaviors.
result The feasibility of addictive wireheading in RL agents was demonstrated, providing venues for further research.
Framework for multi-agent RL with human feedback in a Snake game.
problem Improving multi-agent reinforcement learning with human feedback.
method Developed a simulated game environment for offline model training and online competitions. Introduced HILL methods and reward manipulation heuristics.
result Agents with HILL methods outperform those without in online competitions.
Lecture notes on Teichmüller spaces with boundary examples.
problem Understanding higher Teichmüller spaces of Riemann surfaces with boundaries.
method Explicit and computationally tractable examples, chewing-gum move, snake calculus.
result The chewing-gum move is the inverse of amalgamation in bordered cusped Teichmüller space.
This paper generalizes knot polynomials to include the HOMFLY polynomial.
problem Generalizing knot polynomials to include the HOMFLY polynomial.
method Using path posets to directly generalize the construction of the Jones and Alexander polynomials to the HOMFLY polynomial.
result The HOMFLY polynomial is obtained by specializing path posets.
New q-deformed integers help compute Jones polynomials efficiently.
problem Computing Jones polynomials of rational links efficiently.
method Defining q-deformed integers from pairs of coprime integers and using them to compute Jones polynomials.
result Efficient algorithm for computing Jones polynomials of rational links.
A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over the graph. When applying the proximal gradient algorithm to solve this problem, t…
Under appropriate assumptions, we generalize the concept of linear almost Poisson struc- tures, almost Lie algebroids, almost differentials in the framework of Banach anchored bundles and the relation between these objects. We then obtain an adapted formalism for mechanical systems which is illustrated by the evolution…
The paper encodes local shapes of polynomial curves using permutations.
problem Measuring non-convexity of real algebraic plane curves.
method Generic projections avoiding specific tangencies.
result Local shapes of curves can be encoded in alternating permutations.
Explains the Schwarz lemma in lecture notes.
problem None explicitly stated; focuses on explanation.
method Expository notes on the Schwarz lemma.
result Explains the Schwarz lemma.
Author provides an alternate proof of the free ribbon lemma.
problem Proving that every free sphere-link in the 4-sphere is a ribbon sphere-link.
method An alternate proof of the free ribbon lemma.
result Provides an alternate proof of the free ribbon lemma.
The paper extends Schwarz's lemma to RC-positivity and complex manifolds.
problem Comparing metrics with RC-positivity in complex manifolds.
method Establishing Schwarz lemmas for RC-positivity and applying them to complex manifolds.
result New diameter and volume comparison theorems.
New CR-structures lemma simplifies CR-manifold deformation proof.
problem Deformation unobstructedness of CR-manifolds.
method New Tian-Todorov lemma applied to CR-manifolds.
result Reproved deformation unobstructedness of CR-manifolds.
Survey on strong closing lemmas in Hamiltonian dynamics.
problem Understanding dynamics in Hamiltonian systems.
method Use spectral invariants in symplectic geometry.
result Proofs of strong closing lemmas in various dimensions.
Study several weak forms of a lemma on compact complex manifolds.
problem Understanding weak forms of a lemma on compact complex manifolds.
method Complete unified study of weak forms of the $\ddb-$Lemma.
result Unified understanding of various weak forms of the $\ddb-$Lemma.
Unified Schwarz lemma in Kähler and Hermitian geometry.
problem Various forms of the Schwarz lemma in Kähler and Hermitian geometry.
method Introducing new curvatures to refine and elucidate the real bisectional curvature.
result Unified Chern-Lu, Aubin-Yau, and Chen-Cheng-Look Schwarz lemmas.
Paper generalizes Schwarz Lemma for VT harmonic maps with conditions.
problem Generalizing Schwarz Lemma for a specific type of harmonic maps.
method Conditions on eigenvalues and Ricci curvature are used to prove the lemma.
result Schwarz Lemma for VT harmonic maps proved with distance and volume decreasing properties.
Formulates Index III lemma and Rauch III theorem with applications.
problem Develops new mathematical theorems based on existing ones.
method Formulation of Index III lemma and Rauch III theorem based on Index I, II lemmas and Rauch I, II theorems.
result Presented Rauch's type theorem and volume comparison result as applications.
New Schwarz Lemma for Bergman metrics in bounded domains.
problem Finding bounds for Bergman metrics in bounded domains.
method Using Cauchy-Schwarz inequality from probability theory.
result Established a new Schwarz Lemma for Bergman metrics.
Tucker and Ky Fan's lemma are combinatorial analogs of the Borsuk-Ulam theorem (BUT). In 1996, Yu. A. Shashkin proved a version of Fan's lemma, which is a combinatorial analog of the odd mapping theorem (OMT). We consider generalizations of these lemmas for BUT-manifolds, i.e. for manifolds that satisfy BUT. Proofs rel…
Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.
problem Comparing geometric quantities of circle packings with different boundary values.
method Combinatorial Calabi flows and maximum principle.
result Discrete Schwarz-Pick lemma proven for generalized circle packings.
The paper improves Zakalyukin's lemma for frontals and applies it to surface singularities.
problem Improving the conditions under which wave front germs imply map germs.
method Generalization of Zakalyukin's lemma for frontals and applications to surface singularities.
result The paper provides a more general version of Zakalyukin's lemma for map germs.
Meridian lemma extended to fully alternating links in thickened surfaces.
problem Extending Menasco's meridian lemma to fully alternating links in thickened surfaces.
method Developed a new meridian lemma for fully alternating links in thickened orientable surfaces of positive genus.
result The meridian lemma holds for fully alternating links in thickened surfaces.
Proves a quantitative closing lemma for negatively curved manifolds.
problem Closing lemma for negatively curved manifolds.
method Quantitative closing lemma proof.
result Study of partner and pseudo-partner orbits for self-crossing closed geodesics.
Paper generalizes Schwarz lemma for harmonic maps between Riemannian manifolds.
problem Generalizing Schwarz lemma for harmonic maps.
method Using Bochner techniques and sub-Laplacian comparison theorem.
result Established a generalization of Schwarz lemma for transversally harmonic maps.
Extends Margulis Lemma to RCD(K,N) spaces.
problem Applying Margulis Lemma to new geometric structures.
method Improved Regularity Estimates for Regular Langrangian Flows.
result Margulis Lemma extended to RCD(K,N) spaces.
The paper characterizes when the ∂∂-lemma holds for twistor spaces.
problem Characterizing the ∂∂-lemma for twistor spaces. method Study Bott-Chern and Aeppli cohomologies of twistor spaces.
result Explicit computation of Dolbeault cohomology for flat torus twistor space.
For a symplectic manifold (M,ω), not necessarily hard Lefschetz, we prove a version of the Merkulov dδ--lemma. We also study the dδ--lemma and related cohomologies for compact symplectic solvmanifolds.
Positive representations on surfaces have positive cross-ratios and satisfy a collar lemma.
problem Characterizing representations of surface groups with positive properties.
method Proving a collar lemma and showing positivity of cross-ratios for Θ-positive representations. result Closed subsets of representation varieties are characterized by Θ-positive representations. Proves a generalized Whitehead cut vertex lemma for tree groups.
problem Extending Whitehead's cut vertex lemma to tree group conjugacy classes.
method Proves a version of Whitehead's lemma for tree groups.
result Establishes a cut vertex in star graphs for tree group conjugacy classes.
Proves a general ∂∂̄-lemma and applies it to a Fujino conjecture.
problem Establishing a general ∂∂̄-lemma and its applications.
method Develops a general ∂∂̄-lemma and applies it to Fujino's conjecture.
result Establishes a Kähler version of Fujino's injectivity theorem.
Enhanced Schwarz lemma for Hermitian manifolds with new curvature constraints.
problem Improving Schwarz lemma for holomorphic maps between Hermitian manifolds.
method Introducing new curvature constraints on source and target manifolds, controlling by holomorphic sectional curvature.
result Significant improvements on the Wu--Yau theorem and Schwarz lemma for Gauduchon connections.
Corrects a proof gap in the Morse lemma for hyperbolic spaces.
problem Gap in the proof of optimal bounds for the Morse lemma in Gromov-hyperbolic spaces.
method Describes a computer certification of the corrected result.
result Corrects the main theorem of [ShCh13a] in optimal bounds for the Morse lemma.
Schwarz lemma extended to equality cases and curvature on manifolds.
problem Extending Schwarz lemma to equality cases and studying curvature.
method Analyzing Schwarz lemma inequalities and equalities, studying holomorphic sectional curvature.
result Holomorphic maps are totally geodesic and have constant rank when Schwarz lemma equality holds.
Generalized Stacey-Roberts lemma for Banach manifolds.
problem Constructing Lie groupoids of smooth mappings in infinite-dimensional geometry.
method Generalization of the Stacey-Roberts lemma to Banach manifolds with smooth partitions of unity.
result Remedied an error in the original proof for finite-dimensional setting.
Thurston's jiggling lemma simplifies triangulations.
problem Simplifying triangulations into a general position.
method Alternative, conceptual proof and generalization to manifolds.
result A more straightforward proof of Thurston's jiggling lemma.
Extends Stein's lemma to exponential-family mixtures for gradient computation.
problem Computing gradients for complex distributions with weak assumptions.
method Generalizes Stein's lemma to exponential-family mixtures and applies it to reparameterization trick.
result Derives new gradient identities for various distributions.