Publications related to On some algebraic and extremal problems in discrete geometry

Improving SAM Requires Rethinking its Optimization Formulation

Volkan Cevher, Kimon Antonakopoulos, Thomas Michaelsen Pethick, Wanyun Xie, Fabian Ricardo Latorre Gomez

This paper rethinks Sharpness-Aware Minimization (SAM), which is originally formulated as a zero-sum game where the weights of a network and a bounded perturbation try to minimize/maximize, respectively, the same differentiable loss. We argue that SAM shou ...

2024

Moments of the number of points in a bounded set for number field lattices

Maryna Viazovska, Nihar Prakash Gargava, Vlad Serban

We examine the moments of the number of lattice points in a fixed ball of volume

V

for lattices in Euclidean space which are modules over the ring of integers of a number field

K

. In particular, denoting by

ω_K

the number of roots of unity in

K

, we ...

arXiv2023

The first Grushin eigenvalue on cartesian product domains

Joachim Stubbe, Luigi Provenzano, Paolo Luzzini

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

WALTER DE GRUYTER GMBH2023

Small-angle scattering tensor tomography algorithm for robust reconstruction of complex textures

Marianne Liebi, Manuel Guizar Sicairos

The development of small-angle scattering tensor tomography has enabled the study of anisotropic nanostructures in a volume-resolved manner. It is of great value to have reconstruction methods that can handle many different nanostructural symmetries. For s ...

Chester2023

Global Frobenius liftability I

Maciej Emilian Zdanowicz

We formulate a conjecture characterizing smooth projective varieties in positive characteristic whose Frobenius morphism can be lifted modulo p(2)-we expect that such varieties, after a finite stale cover, admit a toric fibration over an ordinary abelian v ...

EUROPEAN MATHEMATICAL SOC-EMS2021

Complexity of linear relaxations in integer programming

Matthias Schymura

For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Coordinate Difference Matrices

Martin Vetterli, Gilles Baechler, Miranda Krekovic, Golnooshsadat Elhami

In many problems such as phase retrieval, molecular biology, source localization, and sensor array calibration, one can measure vector differences between pairs of points and attempt to recover the position of these points; this class of problems is called ...

SIAM PUBLICATIONS2020

Shapes From Echoes: Uniqueness From Point-to-Plane Distance Matrices

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study the problem of localizing a configuration of points and planes from the collection of point-to-plane distances. This problem models simultaneous localization and mapping from acoustic echoes as well as the & x201C;structure from sound & x201D; app ...

2020

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

On some algebraic and extremal problems in discrete geometry

Graph Chatbot

Chat with Graph Search

Improving SAM Requires Rethinking its Optimization Formulation

Moments of the number of points in a bounded set for number field lattices

The first Grushin eigenvalue on cartesian product domains

Small-angle scattering tensor tomography algorithm for robust reconstruction of complex textures

Global Frobenius liftability I

Complexity of linear relaxations in integer programming

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Coordinate Difference Matrices

Shapes From Echoes: Uniqueness From Point-to-Plane Distance Matrices

A lower bound on opaque sets

Improving SAM Requires Rethinking its Optimization Formulation

The first Grushin eigenvalue on cartesian product domains

Small-angle scattering tensor tomography algorithm for robust reconstruction of complex textures

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Moments of the number of points in a bounded set for number field lattices

Global Frobenius liftability I

Complexity of linear relaxations in integer programming

Coordinate Difference Matrices

Shapes From Echoes: Uniqueness From Point-to-Plane Distance Matrices

A lower bound on opaque sets