相关论文: On Periodic Decompositions and Nonexpansive Lines
This paper deals with the introduction of a decomposition of the deformations of curved thin beams, with section of order $\delta$, which takes into account the specific geometry of such beams. A deformation $v$ is split into an elementary…
We present a non-vacuous definition of compositionality. It is based on the idea of combining the minimum description length principle with the original definition of compositionality (that is, that the meaning of the whole is a function of…
We consider the third order operator with small 1-periodic coefficients on the real line. The spectrum of the operator is absolutely continuous and covers all real line. Under the minimal conditions on the coefficients we show that there…
The goal of this work is to study the existence of quasi-periodic solutions in time to nonlinear beam equations with a multiplicative potential. The nonlinearities are required to only finitely differentiable and the frequency is along a…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition. Seymour (1981) proved that every 2-connected loopless Eulerian planar…
The 3-decomposition conjecture is wide open. It asserts that every finite connected cubic graph can be decomposed into a spanning tree, a disjoint union of cycles, and a matching. We show that every such decomposition is derived from a…
We first give a decomposition for a $T$-invariant sublinear expectation $\mathbb{E}=\sup_{P\in\Theta}\mathrm{E}_P$, and show that each component $\mathbb{E}^{(d)}=\sup_{P\in\Theta^{(d)}}\mathrm{E}_P$ of the decomposition has a finite period…
A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…
A key step in reverse engineering neural networks is to decompose them into simpler parts that can be studied in relative isolation. Linear parameter decomposition -- a framework that has been proposed to resolve several issues with current…
This is the second in a trilogy of papers introducing and studying the notion of decomposition space as a general framework for incidence algebras and M\"obius inversion, with coefficients in $\infty$-groupoids. A decomposition space is a…
We introduce the notion of decomposition space as a general framework for incidence algebras and M\"obius inversion: it is a simplicial infinity-groupoid satisfying an exactness condition weaker than the Segal condition, which expresses…
We show that a problem on minimal periods of solutions of Lipschitz functional differential equations is closely related to the unique solvability of the periodic problem for linear functional differential equations. Sharp bounds for…
As a first step toward a fully two-dimensional asymptotic theory for the bifurcation of solitons from infinitesimal continuous waves, an analytical theory is presented for line solitons, whose envelope varies only along one direction, in…
We consider non-commutative deformations of sheaves on algebraic varieties. We develop some tools to determine parameter algebras of versal non-commutative deformations for partial simple collections and the structure sheaves of smooth…
We study copositive matrices which admit a decomposition into a sum of a positive semidefinite matrix and a matrix with nonnegative entries. Our main result shows that if the off-diagonal entries of a copositive matrix are nondecreasing in…
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this…
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
We consider $k$ intervals on the real line whose images under a continuous map $f$ contain themselves. It's conjectured that there exists a periodic point of period not bigger than $k$ in these intervals. We prove the conjecture for $k=5$…