English
Related papers

Related papers: Pl\"ucker environments, wiring and tiling diagrams…

200 papers

An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…

Computational Complexity · Computer Science 2013-12-30 Manami Shigeta , Kazuyuki Amano

We show that the partial sums of the long Pl\"ucker relations for pairs of weakly separated Pl\"ucker coordinates oscillate around $0$ on the totally nonnegative part of the Grassmannian. Our result generalizes the classical oscillating…

Combinatorics · Mathematics 2024-01-26 Daniel Soskin , Prateek Kumar Vishwakarma

For a locally finite set in $\mathbb{R}^2$, the order-$k$ Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of…

Combinatorics · Mathematics 2024-08-26 Herbert Edelsbrunner , Alexey Garber , Mohadese Ghafari , Teresa Heiss , Morteza Saghafian

We analyse a class of quantum field theory models illustrating some of the possibilities that have emerged in the general study of the short distance properties of superselection sectors, performed in a previous paper (together with R.…

Mathematical Physics · Physics 2010-11-11 Claudio D'Antoni , Gerardo Morsella

We prove a bubble tree convergence theorem for a sequence of closed Hamiltonian Stationary Lagrangian surfaces with bounded areas and Willmore energies in a complete K{\"a}hler surface. We also prove two strong compactness theorems on the…

Differential Geometry · Mathematics 2019-10-08 Jingyi Chen , John Man Shun Ma

We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile types in the overlap region is identical in both translations),…

Computational Geometry · Computer Science 2014-11-26 Ho-Lin Chen , David Doty , Ján Maňuch , Arash Rafiey , Ladislav Stacho

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

Combinatorics · Mathematics 2021-02-25 Julien Cassaigne , Sébastien Labbé , Julien Leroy

We study the relationship between $n$-cluster tilting modules over $n$ representation finite algebras and the Euler forms. We show that the dimension vectors of cluster-indecomposable modules give the roots of the Euler form. Moreover, we…

Representation Theory · Mathematics 2014-02-26 Yuya Mizuno

For a real reflection group the reflecting hyperplanes cut out on the unit sphere a simplicial complex called the Coxeter complex. Abramenko showed that each reflecting hyperplane meets the Coxeter complex in another Coxeter complex if and…

Combinatorics · Mathematics 2017-10-17 Alexander R. Miller

This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered…

Computational Complexity · Computer Science 2011-04-12 Lila Kari , Benoît Masson

In this paper, we prove a higher integrability result for very weak solutions of higher-order elliptic systems involving a double phase operator as the principal part. As a model case, we consider \begin{equation} \int_{\Omega} \left( |D^m…

Analysis of PDEs · Mathematics 2026-02-04 Yoshiki Kaiho

We prove a generalization of the Brill-Noether theorem for the variety of special divisors $W^r_d(C)$ on a general curve $C$ of prescribed gonality. Our main theorem gives a closed formula for the dimension of $W^r_d(C)$. We build on…

Algebraic Geometry · Mathematics 2022-03-01 David Jensen , Dhruv Ranganathan

One tuple of probability vectors is more informative than another tuple when there exists a single stochastic matrix transforming the probability vectors of the first tuple into the probability vectors of the other. This is called matrix…

Statistics Theory · Mathematics 2024-04-26 Muhammad Usman Farooq , Tobias Fritz , Erkka Haapasalo , Marco Tomamichel

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz

For an isolated hypersurface singularity which is neither simple nor simple elliptic, it is shown that there exists a distinguished basis of vanishing cycles which contains two basis elements with an arbitrary intersection number. This…

Algebraic Geometry · Mathematics 2017-06-13 Wolfgang Ebeling

It is shown that the complex field equipped with the "approximate exponential map", defined up to ambiguity from a small group, is quasiminimal: every automorphism-invariant subset of the field is countable or co-countable. If the ambiguity…

Logic · Mathematics 2019-11-19 Jonathan Kirby

We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that,…

Machine Learning · Computer Science 2023-11-06 Zachary Chase , Bogdan Chornomaz , Shay Moran , Amir Yehudayoff

We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…

Dynamical Systems · Mathematics 2008-01-21 Ayse A. Sahin

We study certain structural properties of fine zonotopal tilings, or cubillages, on cyclic zonotopes $Z(n,d)$ of an arbitrary dimension $d$ and their relations to $(d-1)$-separated collections of subsets of a set $\{1,2,\ldots,n\}$.…

Combinatorics · Mathematics 2018-11-30 V. I. Danilov , A. V. Karzanov , G. A. Koshevoy

We consider the algorithmic problem of generating each subset of $[n]:=\{1,2,\ldots,n\}$ whose size is in some interval $[k,l]$, $0\leq k\leq l\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by…

Combinatorics · Mathematics 2018-02-16 Petr Gregor , Torsten Mütze