English
Related papers

Related papers: A linear threshold for uniqueness of solutions to …

200 papers

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Probability · Mathematics 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…

Combinatorics · Mathematics 2015-12-09 Cyril Banderier , Pawel Hitczenko

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

Number Theory · Mathematics 2025-05-06 Ajai Choudhry

In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…

Number Theory · Mathematics 2020-06-01 Long Li , Su-Dan Wang

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

Probability · Mathematics 2017-06-30 Igor Kortchemski , Cyril Marzouk

An integer partition of $n$ is a decreasing sequence of positive integers that add up to $[n]$. Back in $1979$ Macdonald posed a question about the limit value of the probability that two partitions chosen uniformly at random, and…

Combinatorics · Mathematics 2018-03-13 Boris Pittel

Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…

Data Structures and Algorithms · Computer Science 2017-03-29 Martin Ebbesen , Paul Fischer , Carsten Witt

The puzzle method was introduced by Choi and Park as an effective method for finding non-singular characteristic maps over wedged simplicial complexes $K(J)$ obtained from a given simplicial complex $K$. We study further the mod 2 case of…

Geometric Topology · Mathematics 2022-10-19 Suyoung Choi , Mathieu Vallée

We study the broadcasting problem when the underlying tree is a random recursive tree. The root of the tree has a random bit value assigned. Every other vertex has the same bit value as its parent with probability $1-q$ and the opposite…

Probability · Mathematics 2021-04-27 Louigi Addario-Berry , Luc Devroye , Gabor Lugosi , Vasiliki Velona

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

Probability · Mathematics 2008-02-29 Terence Tao , Van Vu

In this work we consider the primal mixed variational formulation of the Poisson equation with a line source. The analysis and approximation of this problem is non-standard as the line source causes the solutions to be singular. We start by…

Analysis of PDEs · Mathematics 2019-10-28 Ingeborg G. Gjerde , Kundan Kumar , Jan M. Nordbotten

The Number Rotation Puzzle (NRP) is a combination puzzle in which the goal is to rearrange a scrambled rectangular grid of numbers back into order via moves that consist of rotating square blocks of numbers of fixed size. Over all possible…

Combinatorics · Mathematics 2022-12-01 Thomas Lam

Let $A_n$ be an $n\times n$ random symmetric matrix with $(A_{ij})_{i< j}$ i.i.d. mean $0$, variance 1, following a subGaussian distribution and diagonal elements i.i.d. following a subGaussian distribution with a fixed variance. We…

Probability · Mathematics 2024-05-15 Yi Han

In combinatorial reconfiguration, the reconfiguration problems on a vertex subset (e.g., an independent set) are well investigated. In these problems, some tokens are placed on a subset of vertices of the graph, and there are three natural…

Computational Complexity · Computer Science 2021-09-07 Masaaki Kanzaki , Yota Otachi , Ryuhei Uehara

We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, $n$ players are fitted with randomly assigned colored hats. Individual players can…

Information Theory · Computer Science 2007-07-16 Hendrik W. Lenstra , Gadiel Seroussi

As an alternative to the paradigmatic fragmentation problem of a single object crushed into a great number of pieces, we survey a large collection of identical bodies, each one randomly split into two fragments only. While some key features…

Statistical Mechanics · Physics 2015-05-30 Fernando Parisio , Laercio Dias

In this paper we introduce new types of square-piece jigsaw puzzles, where in addition to the unknown location and orientation of each piece, a piece might also need to be flipped. These puzzles, which are associated with a number of real…

Computer Vision and Pattern Recognition · Computer Science 2017-11-21 Dror Sholomon , Eli David , Nathan S. Netanyahu

Complex Hermitian random matrices with a unitary symmetry can be distinguished by a weight function. When this is even, it is a known result that the distribution of the singular values can be decomposed as the superposition of two…

Probability · Mathematics 2015-03-26 Folkmar Bornemann , Peter J. Forrester

We revisit a classical crossword filling puzzle which already appeared in Garey\&Jonhson's book. We are given a grid with $n$ vertical and horizontal slots and a dictionary with $m$ words and are asked to place words from the dictionary in…

Computational Complexity · Computer Science 2021-09-24 Laurent Gourvès , Ararat Harutyunyan , Michael Lampis , Nikolaos Melissinos

Jigsaw puzzle solving is an intriguing problem which has been explored in computer vision for decades. This paper focuses on a specific variant of the problem - solving puzzles with eroded boundaries. Such erosion makes the problem…

Image and Video Processing · Electrical Eng. & Systems 2019-12-03 Dov Bridger , Dov Danon , Ayellet Tal
‹ Prev 1 3 4 5 6 7 10 Next ›