arXiv research

Defines computable learning for binary classification over metric spaces.

We observe that the strong slope conjecture implies that the degree of the colored Jones polynomial detects all torus knots. As an application we obtain that an adequate knot that has the same colored Jones polynomial degrees as a torus knot must be a $(2,q)$-torus knot.

The Slope Conjecture proposed by Garoufalidis asserts that the degree of the colored Jones polynomial determines a boundary slope, and its refinement, the Strong Slope Conjecture proposed by Kalfagianni and Tran asserts that the linear term in the degree determines the topology of an essential surface that satisfies th…

The study shows strong formality in certain complex manifolds.

The (Strong) Slope Conjecture relates the degree of the colored Jones polynomial of a knot to certain essential surfaces in the knot complement. We verify the Slope Conjecture and the Strong Slope Conjecture for 3-string Montesinos knots satisfying certain conditions.

The study connects hypergraphs to strong homotopy Lie algebras.

Groups with hyperbolic properties don't have strong Property (T).

Jones slopes detect figure eight knot, and characterize alternating knots.

Using the Hatcher-Oertel algorithm for finding boundary slopes of Montesinos knots, we prove the Slope Conjecture and the Strong Slope Conjecture for a family of 3-tangle pretzel knots. More precisely, we prove that the maximal degrees of the colored Jones polynomial of such knots determine a boundary slope as predicte…

Study Mazur doubles of knots and their relation to the Slope Conjecture.

New algorithm achieves strong consistency in binary non-uniform hypergraph classification.

Homological stability for unordered configuration spaces of connected manifolds was discovered by Th. Church and extended by O. Randal-Williams and B. Knudsen: $H_i(C_k(M);\mathbb{Q})$ is constant for $k\geq f(i)$. We characterize the manifolds satisfying strong stability: $H^*(C_k(M);\mathbb{Q})$ is constant for $k\gg…

We describe a normal surface algorithm that decides whether a knot, with known degree of the colored Jones polynomial, satisfies the Strong Slope Conjecture. We also discuss possible simplifications of our algorithm and state related open questions. We establish a relation between the Jones period of a knot and the num…

For a branched cover between two closed orientable surfaces, the Riemann-Hurwitz formula relates the Euler characteristics of the surfaces, the total degree of the cover, and the total length of the partitions of the degree given by the local degrees at the preimages of the branching points. A very old problem asks whe…

This study evaluates prewar Japanese financial market efficiency using time-varying models.

When the available statistical information is imperfect, it is dangerous to follow standard optimisation procedures to construct an optimal portfolio, which usually leads to a strong concentration of the weights on very few assets. We propose a new way, based on generalised entropies, to ensure a minimal degree of dive…

The study characterizes and constructs polynomial harmonic morphisms on spheres.

Study homeomorphism groups of ordinals, proving strong distortion and normal generators.

Statistical query algorithms and low-degree tests are nearly equivalent in high-dimensional hypothesis testing.

The paper explores how different network architectures learn logical functions under GOTU, finding that a min-degree-interpolator is learned.

We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogen…

We establish a characterization of adequate knots in terms of the degree of their colored Jones polynomial. We show that, assuming the Strong Slope conjecture, our characterization can be reformulated in terms of "Jones slopes" of knots and the essential surfaces that realize the slopes .For alternating knots the refor…

The Slope Conjecture relates the degree of the colored Jones polynomial to the boundary slopes of a knot. We verify the Slope Conjecture and the Strong Slope Conjecture for Montesinos knots $M(\frac{1}{r},\frac{1}{s-\frac{1}{u}},\frac{1}{t} )$ with $r,u,t$ odd, $s$ even and $u\leq-1$, $r<-1<1<s,t$.

A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it G-degree} of the involved graphs, which drives the {\it $1/N$ expansion} in the tensor …

We study Maurer-Cartan elements on homotopy Poisson manifolds of degree $n$. They unify many twisted or homotopy structures in Poisson geometry and mathematical physics, such as twisted Poisson manifolds, quasi-Poisson $\g$-manifolds, and twisted Courant algebroids. Using the fact that the dual of an $n$-term $L_\infty…

We embed arbitrary groups into regular graphs with prescribed automorphisms.

Degree-Quant improves GNN efficiency by quantizing them without losing accuracy.

To a branched cover between closed, connected and orientable surfaces one associates a "branch datum", which consists of the two surfaces, the total degree d, and the partitions of d given by the collections of local degrees over the branching points. This datum must satisfy the Riemann-Hurwitz formula. A "candidate su…

Strong inductive biases prevent harmless interpolation in overparameterized models.

The European Union and Eurozone present an inquisitive case of strongly interconnected network with high degree of dependence among nodes. This research focused on investment network of European Union and its major trading partners for specific time period 2001 to 2014. The changing investment patterns within Eurozone …

We prove that a circle bundle over a closed oriented aspherical manifold with hyperbolic fundamental group admits a self-map of absolute degree greater than one if and only if it is virtually trivial. This generalizes in every dimension the case of circle bundles over hyperbolic surfaces, for which the result was known…

In the early 2000's Cochran and Harvey introduced non-commutative Alexander polynomials for 3-manifolds. Their degrees give strong lower bounds on the Thurston norm. In this paper we make the case that the vanishing of a certain Novikov-Sikorav homology module is the correct notion of a monic non-commutative Alexander …

We show that for each discrete group G, the rational assembly map K_*(BG) \otimes Q \to K_*(C*_{max} G) \otimes \Q is injective on classes dual to the subring generated by cohomology classes of degree at most 2 (identifying rational K-homology and homology via the Chern character). Our result implies homotopy invarianc…

Let $A \subset \mathbb{R} ^2$ be a smooth doubly connected domain. We consider the Dirichlet energy $E(u)=\int_{A} |\nabla u|^2$, where $u:A \rightarrow \mathbb{C}$, and look for critical points of this energy with prescribed modulus $|u|=1$ on $\partial A$ and with prescribed degrees on the two connected components o…

Let M be a closed orientable 3-manifold with a negatively curved Riemannian metric. Let {M_i} be a collection of finite regular covers with degree d_i. (1) If the Heegaard genus of M_i grows more slowly than the square root of d_i, then M_i has positive first Betti number for all sufficiently large i. (2) The strong He…

This paper studies both the conductance and charge transport on 2D orbifolds in a strong magnetic field. We consider a family of Landau Hamiltonians on a complex, compact 2D orbifold $Y$ that are parametrised by the Jacobian torus $J(Y)$ of $Y$. We calculate the degree of the associated stable holomorphic spectral orbi…

We consider the task of fitting a regression model involving interactions among a potentially large set of covariates, in which we wish to enforce strong heredity. We propose FAMILY, a very general framework for this task. Our proposal is a generalization of several existing methods, such as VANISH [Radchenko and James…

Investors in stock market are usually greedy during bull markets and scared during bear markets. The greed or fear spreads across investors quickly. This is known as the herding effect, and often leads to a fast movement of stock prices. During such market regimes, stock prices change at a super-exponential rate and ar…

New model reveals balance crucial for robust neural coding.

Uniformly random permutations converge to regular representation on surface groups.

We investigate knot-theoretic properties of geometrically defined curvature energies such as integral Menger curvature. Elementary radii-functions, such as the circumradius of three points, generate a family of knot energies guaranteeing self-avoidance and a varying degree of higher regularity of finite energy curves. …

The aim of this paper is to quantify and manage systemic risk caused by default contagion in the interbank market. We model the market as a random directed network, where the vertices represent financial institutions and the weighted edges monetary exposures between them. Our model captures the strong degree of heterog…

We establish that over a C^{2,1} manifold the exponential map of any Lipschitz connection or spray determines a local Lipeomophism and that, furthermore, reversible convex normal neighborhoods do exist. To that end we use the method of Picard-Lindelof approximation to prove the strong differentiability of the exponenti…

Lasso method applied to polynomial models with hierarchy constraints.

Study on symmetry defects of complete intersections in complex space.

Ensemble techniques are powerful approaches that combine several weak learners to build a stronger one. As a meta learning framework, ensemble techniques can easily be applied to many machine learning techniques. In this paper we propose a neural network extended with an ensemble loss function for text classification. …

Lasso performs poorly with correlated covariates, but a rescaled approach fixes this.

Graphical models are a rich language for describing high-dimensional distributions in terms of their dependence structure. While there are algorithms with provable guarantees for learning undirected graphical models in a variety of settings, there has been much less progress in the important scenario when there are lat…