English
Related papers

Related papers: How to bounce your canon permutation

200 papers

We study permutation-invariant embeddings of $d$-dimensional point sets, which are defined by sorting $D$ independent one-dimensional projections of the input. Such embeddings arise in graph deep learning where outputs should be invariant…

Machine Learning · Computer Science 2026-05-26 Nadav Dym , Matthias Wellershoff , Efstratios Tsoukanis , Daniel Levy , Radu Balan

In solving a system of $n$ linear equations in $d$ variables $Ax=b$, the condition number of the $n,d$ matrix $A$ measures how much errors in the data $b$ affect the solution $x$. Estimates of this type are important in many inverse…

Machine Learning · Computer Science 2020-04-29 Tomaso Poggio , Gil Kur , Andrzej Banburski

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…

High Energy Physics - Lattice · Physics 2008-11-26 A. Gonzalez-Arroyo

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

Combinatorics · Mathematics 2021-11-02 Zhicheng Gao

In this work, we study probing for the more general problem of computing the trace of a permutation of $A^{-1}$, say $PA^{-1}$. The motivation comes from Lattice QCD where we need to construct "disconnected diagrams" to extract…

High Energy Physics - Lattice · Physics 2022-11-10 Heather Switzer , Andreas Stathopoulos , Eloy Romero , Jesse Laeuchli , Kostas Orginos

A polynomial lemniscate is a curve in the complex plane defined by $\{z \in \mathbb{C}:|p(z)|=t\}$. Erd\"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate $\Lambda=\{ z \in…

Probability · Mathematics 2017-11-15 Erik Lundberg , Koushik Ramachandran

We investigate the completely positive semidefinite cone $\mathcal{CS}_+^n$, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size). In particular we study…

Optimization and Control · Mathematics 2015-10-06 Monique Laurent , Teresa Piovesan

We prove an identity conjectured by Adin and Roichman involving the descent set of $\lambda$-unimodal cyclic permutations. These permutations appear in formulas for characters of certain representations of the symmetric group. Such formulas…

Combinatorics · Mathematics 2016-06-07 Kassie Archer

Classical asymptotic theory for statistical inference usually involves calibrating a statistic by fixing the dimension $d$ while letting the sample size $n$ increase to infinity. Recently, much effort has been dedicated towards…

Statistics Theory · Mathematics 2024-05-14 Ilmun Kim , Aaditya Ramdas

We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…

Combinatorics · Mathematics 2021-03-01 Ivan Chajda , Helmut Länger

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

Rings and Algebras · Mathematics 2013-05-10 George M. Bergman

Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make the…

Probability · Mathematics 2009-09-08 Adam Timar

The number of Dyck paths of semilength $n$ is famously $C_n$, the $n$th Catalan number. This fact follows after noticing that every Dyck path can be uniquely parsed according to a context-free grammar. In a recent paper, Zeilberger showed…

Combinatorics · Mathematics 2020-09-22 AJ Bu , Robert Dougherty-Bliss

Let $C$ be a reduced complex projective plane curve, and let $d_1$ and $d_2$ be the first two smallest exponents of $C$. For a free curve $C$ of degree $d$, there is a simple formula relating $d,d_1, d_2$ and the total Tjurina number of…

Algebraic Geometry · Mathematics 2025-01-14 Alexandru Dimca

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

Computational Complexity · Computer Science 2017-04-24 Andrii Riazanov , Mikhail Vyalyiy

The article deals with a lexicographic order in various sequences. Consider the axiomatic of lexicographic series, based on the properties of the natural numbers. Elements of the set are ordered first the code length; further in each sign…

Combinatorics · Mathematics 2019-09-18 Gennady Eremin

A family $f_t(z)$ of polynomials over a number field $K$ will be called \emph{weighted homogeneous} if and only if $f_t(z)=F(z^e, t)$ for some binary homogeneous form $F(X, Y)$ and some integer $e\geq 2$. For example, the family $z^d+t$ is…

Number Theory · Mathematics 2017-06-14 Patrick Ingram

A theorem of Tate asserts that, for an elliptic surface E/X defined over a number field k, and a section P of E, there exists a divisor D on X such that the canonical height of the specialization of P to the fibre above t differs from the…

Number Theory · Mathematics 2011-05-06 Patrick Ingram

We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…

Combinatorics · Mathematics 2009-12-25 Hilmar Gudmundsson

Let $\pi=(\pi_1,\pi_2,\hdots,\pi_n)$ be permutation of the elements $1,2,\hdots,n. $ Positive integer $k\leq2^{n-1}$ we call index of $\pi,$ if in its binary notation as $n$-digital binary number, the 1's correspond to the ascent points. We…

Combinatorics · Mathematics 2010-09-23 Vladimir Shevelev