English
Related papers

Related papers: Optimal embedding of Meyer sets into model sets

200 papers

We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…

Representation Theory · Mathematics 2023-05-30 Klaus Bongartz

By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…

Logic · Mathematics 2013-12-25 Mauro Di Nasso

A classical problem in combinatorics seeks colorings of low discrepancy. More concretely, the goal is to color the elements of a set system so that the number of appearances of any color among the elements in each set is as balanced as…

Computer Science and Game Theory · Computer Science 2025-02-19 Ioannis Caragiannis , Kasper Green Larsen , Sudarshan Shyam

We show the existence of various families of properly embedded singly periodic minimal surfaces in R^3 with finite arbitrary genus and Scherk type ends in the quotient. The proof of our results is based on the gluing of small perturbations…

Differential Geometry · Mathematics 2008-07-08 Laurent Hauswirth , Filippo Morabito , Magdalena Rodriguez

Under mild assumptions, we prove that any random multifunction can be represented as the set of minimizers of an infinitely many differentiable normal integrand, which preserves the convexity of the random multifunction. We provide several…

Optimization and Control · Mathematics 2021-08-06 Juan Guillermo Garrido , Pedro Pérez-Aros , Emilio Vilches

For almost all Riemannian metrics (in the $C^\infty$ Baire sense) on a closed manifold $M^{n+1}$, $3\leq (n+1)\leq 7$, we prove that the union of all closed, smooth, embedded minimal hypersurfaces is dense. This implies there are infinitely…

Differential Geometry · Mathematics 2018-02-12 Kei Irie , Fernando C. Marques , André Neves

A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…

Combinatorics · Mathematics 2016-01-29 Michał Lasoń

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

Group Theory · Mathematics 2013-07-25 Ben Elias , Lior Silberman , Ramin Takloo-Bighash

Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…

Rings and Algebras · Mathematics 2020-11-04 George M. Bergman

The defective chromatic number of a graph class is the infimum $k$ such that there exists an integer $d$ such that every graph in this class can be partitioned into at most $k$ induced subgraphs with maximum degree at most $d$. Finding the…

Combinatorics · Mathematics 2024-12-16 Chun-Hung Liu

It has been found that Transformer-based language models have the ability to perform basic quantitative reasoning. In this paper, we propose a method for studying how these models internally represent numerical data, and use our proposal to…

Computation and Language · Computer Science 2024-04-26 Ulme Wennberg , Gustav Eje Henter

General arguments of Baumslag and Bieri guarantee that any metabelian group of finite Pr\"ufer rank can be embedded in a metabelian constructible group. Here, we consider the metric behavior of a rich class of examples and analyze the…

Group Theory · Mathematics 2018-03-28 Sean Cleary , Conchita Martínez-Pérez

In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…

Analysis of PDEs · Mathematics 2017-05-19 Camillo De Lellis , Jusuf Ramic

We work in the realm of sets of reals. We prove that in the Miller model and in a model constructed by Goldstern-Judah-Shelah all universally meager sets have size at most $\omega_1$. Some relations between combinatorial covering properties…

Logic · Mathematics 2025-12-18 Valentin Haberl , Piotr Szewczak , Lyubomyr Zdomskyy

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

Optimization and Control · Mathematics 2021-10-26 Miles Lubin , Juan Pablo Vielma , Ilias Zadik

Let $Z$ be an affine algebraic variety and $X$ be a smooth flexible variety. We develop some criteria under which $Z$ admits a closed embedding into $X$. In particular, we show that if $X$ is isomorphic (as an algebraic variety) to a…

Algebraic Geometry · Mathematics 2023-07-04 Shulim Kaliman

We prove some injectivity theorems. Our proof depends on the theory of mixed Hodge structures on cohomology groups with compact support. Our injectivity theorems would play crucial roles in the minimal model theory for higher-dimensional…

Algebraic Geometry · Mathematics 2015-07-06 Osamu Fujino

We prove the existence of a family of embedded doubly periodic minimal surfaces of (quotient) genus $g$ with orthogonal ends that generalizes the classical doubly periodic surface of Scherk and the genus-one Scherk surface of Karcher. The…

Differential Geometry · Mathematics 2010-08-02 Matthias Weber , Michael Wolf

We give a characterization of finite sets of triples of elements (e.g., positive integers) that can be colored with two colors such that for every element $i$ in each color class there exists a triple which does not contain $i$. We give a…

Combinatorics · Mathematics 2020-08-24 Balázs Keszegh

We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…

Logic · Mathematics 2018-02-06 Dániel T. Soukup , Lajos Soukup