English
Related papers

Related papers: Algebraic Geometry of Error Amplification: the Pro…

200 papers

We consider the deformation theory of two kinds of geometric objects: foliations on one hand, pre-symplectic forms on the other. For each of them, we prove that the geometric notion of equivalence given by isotopies agrees with the…

Differential Geometry · Mathematics 2020-08-19 Florian Schaetz , Marco Zambon

We consider the problem of extending maps from algebras to their profinite completions in finitely generated quasivarieties. Our developments are based on the construction of the profinite completion of an algebra as its natural extension.…

Rings and Algebras · Mathematics 2019-06-10 Georges Hansoul , Bruno Teheux

Recent numerical experiments have demonstrated that the choice of optimization geometry used during training can impact generalization performance when learning expressive nonlinear model classes such as deep neural networks. These…

Machine Learning · Computer Science 2022-04-25 Nicholas M. Boffi , Stephen Tu , Jean-Jacques E. Slotine

We present a new framework for the simultaneous optimiziation of both the topology as well as the relative density grading of cellular structures and materials, also known as lattices. Due to manufacturing constraints, the optimization…

Computational Engineering, Finance, and Science · Computer Science 2025-05-27 Jonathan Stollberg , Tarun Gangwar , Oliver Weeger , Dominik Schillinger

The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…

Computational Geometry · Computer Science 2020-07-13 Eduard Eiben , Robert Ganian , Thekla Hamm , Fabian Klute , Martin Nöllenburg

Stiffener layout optimization of complex surfaces is fulfilled within the framework of topology optimization. A combined parameterization method is developed in two aspects. One is to parameterize the material distribution of the stiffener…

Computational Engineering, Finance, and Science · Computer Science 2022-01-26 Weihong Zhang , Shengqi Feng

We present a class of linear programming approximations for constrained optimization problems. In the case of mixed-integer polynomial optimization problems, if the intersection graph of the constraints has bounded tree-width our…

Optimization and Control · Mathematics 2016-10-20 Daniel Bienstock , Gonzalo Munoz

We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be…

Numerical Analysis · Mathematics 2023-01-26 Peter Binev , Francesca Fierro , Andreas Veeser

Node representation learning has demonstrated its efficacy for various applications on graphs, which leads to increasing attention towards the area. However, fairness is a largely under-explored territory within the field, which may lead to…

Machine Learning · Computer Science 2022-01-24 O. Deniz Kose , Yanning Shen

Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…

Optimization and Control · Mathematics 2018-12-06 A Uderzo

For many materials, a precise knowledge of their dispersion spectra is insufficient to predict their ordered phases and physical responses. Instead, these materials are classified by the geometrical and topological properties of their…

Materials Science · Physics 2021-06-16 Qiong Ma , Adolfo G. Grushin , Kenneth S. Burch

In this article we propose a scalable shape optimization algorithm which is tailored for large scale problems and geometries represented by hierarchically refined meshes. Weak scalability and grid independent convergence is achieved via a…

Optimization and Control · Mathematics 2022-05-09 Jose Pinzon , Martin Siebenborn

Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…

Data Structures and Algorithms · Computer Science 2018-11-08 Kaveh Khoshkhah , Mehdi Khosravian Ghadikolaei , Jerome Monnot , Florian Sikora

We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…

Logic in Computer Science · Computer Science 2023-11-30 Lucas Böltz , Viorica Sofronie-Stokkermans , Hannes Frey

The innumerable shapes of plant leaves present a challenge to the explanatory power of biophysical theory. A model is needed that can produce these shapes with a small set of parameters. This paper presents a simple model of leaf shape…

Tissues and Organs · Quantitative Biology 2010-04-27 David A. Young

Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an extension problem, we…

Data Structures and Algorithms · Computer Science 2020-04-28 Eduard Eiben , Robert Ganian , Thekla Hamm , Fabian Klute , Martin Nöllenburg

We study formal deformations of multiplication in an operad. This closely resembles Gerstenhaber's deformation theory for associative algebras. However, this applies to various algebras of Loday-type and their twisted analogs. We explicitly…

Rings and Algebras · Mathematics 2020-09-01 Apurba Das

We chart out the landscape of $\Winfty$-type algebras using $\Wkpq$---a recently discovered one-parameter deformation of $\W_{\rm KP}$. We relate all hitherto known $\Winfty$-type algebras to $\Wkpq$ and its reductions, contractions, and/or…

High Energy Physics - Theory · Physics 2009-10-22 J. M. Figueroa-O'Farrill , J. Mas , E. Ramos

Can we effectively learn a nonlinear representation in time comparable to linear learning? We describe a new algorithm that explicitly and adaptively expands higher-order interaction features over base linear representations. The algorithm…

Machine Learning · Computer Science 2014-10-03 Alekh Agarwal , Alina Beygelzimer , Daniel Hsu , John Langford , Matus Telgarsky

The main result of the paper is a boundedness for $n$-complements on algebraic surfaces. In addition, applications of this theorem to a classification of log Del Pezzo surfaces and of birational contractions for 3-folds are formulated.

alg-geom · Mathematics 2007-05-23 V. V. Shokurov