English
Related papers

Related papers: Embedding structures associated with Riordan array…

200 papers

Consider a symmetric unitary random matrix $V=(v_{ij})_{1 \le i,j \le N}$ from a circular orthogonal ensemble. In this paper, we study moments of a single entry $v_{ij}$. For a diagonal entry $v_{ii}$ we give the explicit values of the…

Probability · Mathematics 2013-01-28 Sho Matsumoto

We consider symmetric partial exclusion and inclusion processes in a general graph in contact with reservoirs, where we allow both for edge disorder and well-chosen site disorder. We extend the classical dualities to this context and then…

Probability · Mathematics 2023-12-04 Simone Floreani , Frank Redig , Federico Sau

In this paper we use well-known results from linear algebra as tools to explore some properties of products of Fibonacci numbers. Specifically, we explore the behavior of the eigenvalues, eigenvectors, characteristic polynomials,…

Combinatorics · Mathematics 2018-08-17 Matthew Blair , Rigoberto Flórez , Antara Mukherjee

Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…

Probability · Mathematics 2018-06-22 Ramon van Handel

General criteria are given for when an embedding of a Mori dream space into another satisfies certain nice combinatorial conditions on some of their associated cones. An explicit example of such an embedding is studied.

Algebraic Geometry · Mathematics 2012-02-15 John Levitt

We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…

Machine Learning · Computer Science 2022-06-30 Jessie Finocchiaro , Rafael M. Frongillo , Bo Waggoner

Recent studies have revealed that neural networks learn interpretable algorithms for many simple problems. However, little is known about how these algorithms emerge during training. In this article, I study the training dynamics of a small…

Machine Learning · Computer Science 2024-10-29 Tiberiu Musat

The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…

Quantum Algebra · Mathematics 2026-03-23 Gandalf Lechner

We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…

Combinatorics · Mathematics 2022-12-21 Michael A. Allen , Kenneth Edwards

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

Classical Analysis and ODEs · Mathematics 2019-12-17 Yuan Xu

A combinatorial interpretation is provided for the moments of characteristic polynomials of random unitary matrices. This leads to a rather unexpected consequence of the Keating and Snaith conjecture: the moments of $\mid\xi(1/2+it)\mid$…

Mathematical Physics · Physics 2007-05-23 E Strahov

We show how to represent various families of Laguerre polynomials by the three-dimensional Riordan arrays, and use the fundamental theorem of Riordan arrays to obtain the corresponding exponential generating functions.

Combinatorics · Mathematics 2025-03-07 Nikolai A. Krylov

We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…

Numerical Analysis · Mathematics 2016-07-06 Leonardo Robol , Raf Vandebril , Paul Van Dooren

We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical…

Combinatorics · Mathematics 2008-03-20 Eduardo H. M. Brietzke

Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…

Formal Languages and Automata Theory · Computer Science 2026-04-20 Paul C. Bell , George Kenison , Reino Niskanen , Igor Potapov , Pavel Semukhin

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

Algebraic Topology · Mathematics 2011-06-29 R. N. Karasev

We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval,…

Classical Analysis and ODEs · Mathematics 2024-04-18 Thomas Wolfs

We prove that simply connected local 2-dimensional simplicial complexes embed in 3-space if and only if their dual matroids are graphic. Examples are provided that the assumptions of simply connectedness and locality are necessary. This may…

Combinatorics · Mathematics 2022-10-28 Johannes Carmesin

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…

Statistical Mechanics · Physics 2015-10-28 Pragya Shukla , Suchetana Sadhukhan

We study the problem of simultaneous geometric embedding of two paths without self-intersections on an integer grid. We show that minimizing the length of the longest edge of such an embedding is NP-hard. We also show that we can minimize…

Computational Geometry · Computer Science 2026-03-11 Stephen Kobourov , William Lenhart , Giuseppe Liotta , Daniel Perz , Pavel Valtr , Johannes Zink