Related papers: Even Linkage Classes

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree…

An almost complete intersection ideal can be seen as a $d$-sequence ideal with the minimal number of generators being one more than its height. In this paper, we give exact formulas for the regularity of powers of graded almost complete…

Network Models with couplings between link pairs are the simplest models for a class of networks with Higher Order interactions. In this paper we give an analytic, general solution to this family of Random Graph Models extending previous…

We show that every 2nd order ODE defines a 4-parameter family of projective connections on its 2-dimensional solution space. In a special case of ODEs, for which a certain point transformation invariant vanishes, we find that this family of…

I show that every rectifiable simple closed curve in the plane can be continuously deformed into a convex curve in a motion which preserves arc length and does not decrease the Euclidean distance between any pair of points on the curve.…

Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their…

We give a brief account on a basic result (Lemma \ref{lem2}) which is a very useful tool in proving various convergence theorems in the framework of the iterative approximation of fixed points of demicontractive mappings in Hilbert spaces.…

We prove that training neural networks on 1-D data is equivalent to solving convex Lasso problems with discrete, explicitly defined dictionary matrices. We consider neural networks with piecewise linear activations and depths ranging from 2…

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

In this paper the author provides a generalization of classical linkage, i.e. linkage by a complete intersection, in a different context. Namely she looks at residuals in the scheme theoretic intersection of a rational normal surface or…

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

We show that for a vertex decomposable simplicial complex $\Delta$, the Rees algebra of $I_{\Delta^{\vee}}$ is a normal Cohen-Macaulay domain. As consequences, we show that any squarefree weakly polymatroidal ideal is normal and we obtain…

The Deligne conjecture (many times a theorem) endows Hochschild cochains of a linear category with the structure of an $E_2$-algebra, that is, of an algebra over the little 2-disks operad. In this paper, we prove the cyclic Deligne…

We construct rational models for classifying spaces of self-equivalences of bundles over simply connected finite CW-complexes relative to a given simply connected subcomplex. Via work of Berglund-Madsen and Krannich this specializes to…

Finding a simple path of even length between two designated vertices in a directed graph is a fundamental NP-complete problem known as the EvenPath problem. Nedev proved in 1999, that for directed planar graphs, the problem can be solved in…

We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…

We characterize the minimal free resolution of zero-dimensional subschemes in the plane with non connected character. This is then used to slightly generalize a result of Sauer about the smoothability of a.C.M. space curves. Some…

We consider the standard contact structure on the supercircle, S^{1|1}, and the supergroups E(1|1), Aff(1|1) and SpO(2|1) of contactomorphisms, defining the Euclidean, affine and projective geometry respectively. Using the new notion of…

V. I. Arnold [Russian Math. Surveys 26 (2) (1971) 29-43] constructed a simple normal form for a family of complex n-by-n matrices that smoothly depend on parameters with respect to similarity transformations that smoothly depend on the same…

Kendall's Similarity Shape Theory for constellations of N points in the carrier space $\mathbb{R}^d$ as quotiented by the similarity group was developed for use in Probability and Statistics. It was subsequently shown to reside within…