We prove existence and uniqueness results for patterns of circles with prescribed intersection angles in constant curvature surfaces. Our method is based on two new functionals--one for the Euclidean and one for the hyperbolic case. We show how Colin de Verdi`ere's, Br"agger's and Rivin's functionals can be derived fro…
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,742 papers · 148 categories
Trend · papers per month
48 results for “Colin de Verdière”
3028 obstructions found for embedding without knots.
problem Finding obstructions for knotless embedding.
method Surveying recent work, updating obstructions, and proposing new questions.
result New obstructions with μ=6 and insights into connectivity.
Three counterexamples show higher eigenvalue multiplicities than conjectured.
problem Determining the maximum eigenvalue multiplicity for closed hyperbolic surfaces.
method Applying the twisted Selberg trace formula to induced representations of triangle groups.
result Found counterexamples with higher eigenvalue multiplicities than previously conjectured.
The paper bounds eigenvalue multiplicities for hyperbolic surfaces using short geodesics.
problem Bounding the multiplicity of Laplacian eigenvalues for hyperbolic surfaces.
method Using the number of short closed geodesics and surface genus.
result Upper bounds on eigenvalue multiplicities, showing sublinear behavior under certain conditions.
Constructions stemming from non-separating planar graphs and their Colin de Verdière invariantmath.CO
New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.
problem Understanding linkability and knotability of graph complements.
method Using maximal non-separating planar graphs to construct examples of maximal linkless and knotless graphs, and analyzing their Colin de Verdière invariant.
result The Colin de Verdière invariant of the complement of a maximal non-separating planar graph satisfies μ(cG) ≤ n-4, and equality holds.
The paper proves that most metrics satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.
problem Understanding metrics that satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.
method Using geometric characterizations and perturbation theory, the paper proves the conjecture for most metrics.
result The Strong Arnold Hypothesis is satisfied for all metrics except for a set of infinite codimension.
Extended bounds on small eigenvalues for pseudo-Laplacians on hyperbolic surfaces.
problem Bounding small eigenvalues of pseudo-Laplacians on hyperbolic surfaces.
method Extended Otal-Rosas bound and Colin de Verdière's spectral theory to hyperbolic surfaces with multiple cusps.
result Extended bounds on small eigenvalues for pseudo-Laplacians.
We extend to orbifolds classical results on quantum ergodicity due to Shnirelman, Colin de Verdière and Zelditch, proving that, for any positive, first-order self-adjoint elliptic pseudodifferential operator P on a compact orbifold X with positive principal symbol p, ergodicity of the Hamiltonian flow of p implies quan…
We present some applications of ideas from partial differential equations and differential geometry to the study of difference equations on infinite graphs. All operators that we consider are examples of "elliptic operators" as defined by Y. Colin de Verdiere. For such operators, we discuss analogs of inequalities of C…
We study rigidity of polyhedral surfaces and the moduli space of polyhedral surfaces using variational principles. Curvature like quantities for polyhedral surfaces are introduced. Many of them are shown to determine the polyhedral metric up to isometry. The action functionals in the variational approaches are derived …
Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.
problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.
Study finds maximal linklessly embeddable graphs up to 11 vertices and their complements.
problem Characterizing linklessly embeddable graphs and their complements.
method Comprehensive search and verification of graphs up to 11 vertices.
result For graphs of order 11, either the graph or its complement is intrinsically linked.
LITE models improve query-document relevance with learnable late interactions.
problem Improving query-document relevance with lower latency and storage.
method Proposes learnable late-interaction models (LITE) that use factorized query and document embeddings followed by a learnable scorer.
result Empirically, LITE outperforms previous late-interaction models in re-ranking tasks.
Proves that emergent algebras right-distributivity implies left-distributivity.
problem Proving the implication between emergent algebra distributivity conditions.
method Analyzing families of quasigroup operations indexed by commutative groups.
result Emergent algebras right-distributive imply left-distributive.
Perron's method and spherical ideal circle patterns with prescribed total geodesic curvaturesmath.GT
Paper proves existence and uniqueness of circle patterns on surfaces with assigned geodesic curvatures.
problem Existence and uniqueness of circle patterns on surfaces with prescribed geodesic curvatures.
method Applied Perron's method and Thurston's algorithm to prove existence and convergence.
result Existence and uniqueness of circle patterns on surfaces with prescribed geodesic curvatures.
In 2004, Sormani and Wei introduced the covering spectrum: a geometric invariant that isolates part of the length spectrum of a Riemannian manifold. In their paper they observed that certain Sunada isospectral manifolds share the same covering spectrum, thus raising the question of whether the covering spectrum is a sp…
We show there exist tunnel number one hyperbolic 3-manifolds with arbitrarily long unknotting tunnel. This provides a negative answer to an old question of Colin Adams.
Challenge hides and seeks privacy in clinical time-series data.
problem De-identifying clinical time-series data while preserving utility and privacy.
method Synthetic data generation to preserve temporal dynamics and limit re-identification risk.
result A novel competition tracks synthetic data generation and patient re-identification.
The paper classifies K-contact forms on 3-manifolds and connects their orbits to spectral invariants.
problem Classifying K-contact forms with specific properties on 3-manifolds.
method Analyzing the Reeb vector field and its orbits, proving diffeomorphism results, and relating to spectral invariants.
result Compact 3-manifolds carrying such K-contact forms are diffeomorphic to lens spaces with specific orbit properties.
The paper studies circle packings on surfaces with boundary and their total geodesic curvatures.
problem Existence and rigidity of circle packings with conical singularities.
method Variational principle and combinatorial Ricci flow.
result Existence and rigidity of circle packings with prescribed total geodesic curvature.
It has been shown by V. Colin that every tight contact 3-manifold can be written as a connected sum of prime manifolds. Here we prove that the summands in this decomposition are unique up to order and contactomorphism.
We present examples of foliations with infinite dimensional basic symplectic and com- plex cohomologies, along with a general sufficient condition for such phenomena. This puts re- strictions on possible generalizations of several finiteness results from Riemannian foliations to any broader class. The examples are also…
In joint work with Yang Huang, we defined a canonical absolute grading on Heegaard Floer homology by homotopy classes of oriented 2-plane fields. A similar grading was defined on embedded contact homology by Michael Hutchings. In this paper we show that the isomorphism between these homology theories defined by Colin-G…
The coefficient of the logarithmic term in the entropy on even spheres is re-computed by the local technique of integrating the finite temperature energy density up to the horizon on static d--dimensional de Sitter space and thence finding the entropy by thermodynamics. Numeric evaluation yields the known answer i.e. (…
Large, pre-trained generative models have been increasingly popular and useful to both the research and wider communities. Specifically, BigGANs a class-conditional Generative Adversarial Networks trained on ImageNet---achieved excellent, state-of-the-art capability in generating realistic photos. However, fine-tuning …
We prove gluing theorems for tight contact structures. In particular, we rederive (as special cases) gluing theorems due to Colin and Makar-Limanov, and present an algorithm for determining whether a given contact structure on a handlebody is tight. As applications, we construct a tight contact structure on a genus 4 h…
In view of A. Andreotti and H. Grauert's vanishing theorem for q-complete domains in C^n, (Théorème de finitude pour la cohomologie des espaces complexes, Bull. Soc. Math. France 90 (1962), 193--259,) we re-prove a vanishing result by J.-P. Sha, (p-convex Riemannian manifolds, Invent. Math. 83 (1986), no. 3, 437--447,)…
EBR improves NMT by re-ranking samples drawn from MLE-trained models.
problem Discrepancy between MLE and BLEU score in neural machine translation.
method Train an energy-based model to mimic BLEU score, then use it for re-ranking.
result EBR consistently improves NMT performance by +4 BLEU points on IWSLT'14 German-English.
New 4D shapes can't be opened like books.
problem Existence of 4D shapes without open book decompositions.
method Demonstrated existence of infinitely many parallelizable 4-manifolds without open book decompositions.
result No open book decomposition for certain Engel manifolds.
Given a link in we will use invariants derived from the Alexander module and the Blanchfield pairing to obtain lower bounds on the Gordian distance between links, the unlinking number and various splitting numbers. These lower bounds generalise results recently obtained by Kawauchi. We give an application restric…
Automatic Debiased Machine Learning for Dynamic Treatment Effects and General Nested Functionalsecon.EM
New method for estimating treatment effects without complex propensity models.
problem Estimating treatment effects in dynamic treatment regimes.
method Recursive Riesz representer estimation for de-biasing corrections.
result Directly estimates de-biasing corrections without auxiliary models.
A Delaunay cell decomposition of a surface with constant curvature gives rise to a circle pattern, consisting of the circles which are circumscribed to the facets. We treat the problem whether there exists a Delaunay cell decomposition for a given (topological) cell decomposition and given intersection angles of the ci…
Steinhaus conjectured that every closed oriented -curve has a pair of anti-parallel tangents. Porter disproved the conjecture by showing that there exist curves with no anti-parallel tangents. Colin Adams rised the question of whether there exists a nontrivial knot in which has no parallel or antiparallel t…
This paper evaluates fairness in deep metric learning and proposes a method to reduce subgroup performance gaps.
problem The negative impact of deep metric learning representations on minority subgroup performance in downstream tasks.
method Definition of fairness in DML through inter-class, intra-class, and uniformity properties; finDML benchmark; Partial Attribute De-correlation (PARADE) method.
result Bias in DML representations propagates to downstream tasks, even with balanced training data.
Many machine learning algorithms are trained and evaluated by splitting data from a single source into training and test sets. While such focus on in-distribution learning scenarios has led to interesting advancement, it has not been able to tell if models are relying on dataset biases as shortcuts for successful predi…
Learning policies on data synthesized by models can in principle quench the thirst of reinforcement learning algorithms for large amounts of real experience, which is often costly to acquire. However, simulating plausible experience de novo is a hard problem for many complex environments, often resulting in biases for …
Researchers approximate spectral targets on manifolds with constant negative curvature.
problem Prescribing an arbitrary finite portion of the Laplace-Beltrami spectrum on manifolds of constant negative curvature.
method Constructing macroscopically heterogeneous hyperbolic covering manifolds in and using discrete spectral limit theorems in .
result Any finite strictly increasing target list can be approximated to arbitrary precision by a closed manifold of constant negative curvature.
The success of deep learning in numerous application domains created the de- sire to run and train them on mobile devices. This however, conflicts with their computationally, memory and energy intense nature, leading to a growing interest in compression. Recent work by Han et al. (2015a) propose a pipeline that involve…
Contact structures on 3-manifolds are analyzed by decomposing the manifold along convex surfaces. Background results of Giroux, Eliashberg, Colin, and Honda are discussed with an emphasis on examples. Convex decompositions are then used to give a new proof of the Gabai-Eliashberg-Thurston Theorem on the existence of un…
This note announces a general construction of characteristic currents for singular connections on a vector bundle. It develops, in particular, a Chern-Weil-Simons theory for smooth bundle maps which, for smooth connections on and , establishes formulas of the type $$ φ\ = \ \text{\rm Res}_φΣ…
This paper re-evaluates hyperparameters for fine-tuning pre-trained models.
problem Current hyperparameter settings for fine-tuning are often ad-hoc and fixed.
method Empirical evaluation of learning rate, batch size, and momentum for fine-tuning.
result Optimal hyperparameters are not only dataset-dependent but also sensitive to domain similarity.
For (2+2)-dimensional nonholonomic distributions, the physical information contained into a spacetime (pseudo) Riemannian metric can be encoded equivalently into new types of geometric structures and linear connections constructed as nonholonomic deformations of the Levi-Civita connection. Such deformations and induced…
Given a transverse knot in a three dimensional contact manifold , in [13] Colin, Ghiggini, Honda and Hutchings define a hat version of embedded contact homology for , that we call , and conjecture that it is isomorphic to the knot Floer homology . We define here a…
Reeb flow made transverse to foliations without invariant measures.
problem Making Reeb flow transverse to foliations without invariant measures.
method Leafwise Brownian motion to construct transverse measures.
result Reeb flow has no contractible orbits when transverse to foliations without invariant measures.
This paper addresses detection of a reverse engineering (RE) attack targeting a deep neural network (DNN) image classifier; by querying, RE's aim is to discover the classifier's decision rule. RE can enable test-time evasion attacks, which require knowledge of the classifier. Recently, we proposed a quite effective app…
Recent advances in high-throughput cDNA sequencing (RNA-Seq) technology have revolutionized transcriptome studies. A major motivation for RNA-Seq is to map the structure of expressed transcripts at nucleotide resolution. With accurate computational tools for transcript reconstruction, this technology may also become us…
We compare the isoperimetric profiles of $S^2 \times \re^3$ and of $S^3 \times \re^2$ with that of a round 5-sphere (of appropriate radius). Then we use this comparison to obtain lower bounds for the Yamabe constants of $S^2 \times \re^3$ and $S^3 \times \re^2$. Explicitly we show that $Y(S^3 \times \re^2, [g_0^3 +dx^2…
Re-initializing neural networks improves generalization but not as much as other techniques.
problem Understanding when and how re-initialization improves neural network performance.
method Empirical comparison of re-initialization with standard training and various regularization techniques.
result Re-initialization is beneficial for generalization but not as much as other techniques, especially when combined with careful tuning of hyperparameters.