Related papers: Decoupling for degenerate hypersurfaces
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…
The article starts with some introductory material about resolution graphs of normal surface singularities (definitions, topological/homological properties, etc). We then discuss the case when the normal surface singularity is an N-fold…
We give a new criterion for when a resolution of a surface of general type with canonical singularities has big cotangent bundle and a new lower bound for the values of $d$ for which there is a surface with big cotangent bundle that is…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
It is shown that a formal mapping between two real-analytic hypersurfaces in complex space is convergent provided that neither hypersurface contains a nontrivial holomorphic variety. For higher codimensional generic submanifolds,…
Several new combinatorial descriptions of closed 4-manifolds have recently been introduced in the study of smooth maps from 4-manifolds to surfaces. These descriptions consist of simple closed curves in a closed, orientable surface and…
Superpixel decomposition methods are widely used in computer vision and image processing applications. By grouping homogeneous pixels, the accuracy can be increased and the decrease of the number of elements to process can drastically…
We give two explicit versions of the decomposition theorem of Beilinson, Bernstein and Deligne applied to the universal family of quartic surfaces of $\mathbb{P}^3$. The starting point of our investigation is the remark that the nodes of a…
Motivated by problems arising in the complex analysis of perturbative quantum field theory, we investigate the homology of finite unions of certain non-degenerate quadratic affine hypersurfaces of complex dimension $n$ in general position.…
This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…
State-of-the-art Graph Neural Networks (GNNs) have limited scalability with respect to the graph and model sizes. On large graphs, increasing the model depth often means exponential expansion of the scope (i.e., receptive field). Beyond…
A graph $G$ contains another graph $H$ as an immersion if $H$ can be obtained from a subgraph of $G$ by splitting off edges and removing isolated vertices. There is an obvious necessary degree condition for the immersion containment: if $G$…
Let $G$ be a simple and finite graph. A graph is said to be \textit{decomposed} into subgraphs $H_1$ and $H_2$ which is denoted by $G= H_1 \oplus H_2$, if $G$ is the edge disjoint union of $H_1$ and $H_2$. If $G= H_1 \oplus H_2 \oplus H_3…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
We introduce a family of area preserving generalized baker's transformations acting on the unit square and having sharp polynomial rates of mixing for Holder data. The construction is geometric, relying on the graph of a single variable…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
Real-world graphs, such as social networks, financial transactions, and recommendation systems, often demonstrate dynamic behavior. This phenomenon, known as graph stream, involves the dynamic changes of nodes and the emergence and…
In Partition Into Complementary Subgraphs (Comp-Sub) we are given a graph $G=(V,E)$, and an edge set property $\Pi$, and asked whether $G$ can be decomposed into two graphs, $H$ and its complement $\overline{H}$, for some graph $H$, in such…