English
Related papers

Related papers: Path generating transforms

200 papers

We construct a functor from the category of admissible finitely presented o-representations of GL(2,F) to the category of finite length o-representations of Gal_{Q_p}, for any finite extension F of Q_p and the ring of integers o of a finite…

Representation Theory · Mathematics 2009-09-23 Marie-France Vigneras

Let $f$ be a cuspidal eigenform (holomorphic or Maass) on the full modular group $SL(2, \mathbb{Z})$ . Let $\chi$ be a primitive character of modulus $P$. We shall prove the following results: 1. Suppose $P = p^r$, where $p$ is a prime and…

Number Theory · Mathematics 2017-06-14 Ritabrata Munshi , Saurabh Kumar Singh

The path space of an inhomogeneous vertex model constructed from the vector representation of $U_q\bigl(gl(2|2)\bigr)$ and its dual is studied for various choices of composite vertices and assignments of $gl(2|2)$-weights. At $q=0$, the…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 R. M. Gade

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…

Number Theory · Mathematics 2026-05-19 Gennady Bachman

The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and…

Computational Complexity · Computer Science 2012-04-26 Paul Bonsma

A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…

Number Theory · Mathematics 2013-06-19 F. Pakovich , A. Zvonkin

The all pairs shortest path problem (APSP) is one of the foundational problems in computer science. For weighted dense graphs on $n$ vertices, no truly sub-cubic algorithms exist to compute APSP exactly even for undirected graphs. This is…

Data Structures and Algorithms · Computer Science 2023-09-26 Barna Saha , Christopher Ye

We consider the standard modules of rectangular highest weights of affine Lie algebras in types $A_{2l-1}^{(2)}$ and $D_{l+1}^{(2)}$. By using vertex algebraic techniques we construct the combinatorial bases for standard modules and their…

Representation Theory · Mathematics 2023-08-08 Marijana Butorac , Slaven Kožić

Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…

Combinatorics · Mathematics 2009-09-29 Robin Pemantle , Mark C. Wilson

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We give an algorithm which calculates the generating function of the cocharacter sequence of the polynomial identities of the algebra of upper block triangular (p+2q) x (p+2q) matrices over a field of characteristic zero with diagonal…

Rings and Algebras · Mathematics 2016-01-13 Vesselin Drensky , Boyan Kostadinov

The graded parafermion conformal field theory at level k is a close cousin of the much-studied Z_k parafermion model. Three character formulas for the graded parafermion theory are presented, one bosonic, one fermionic (both previously…

High Energy Physics - Theory · Physics 2007-05-23 J. -F. Fortin , P. Mathieu , S. O. Warnaar

We study the fully degenerate second-order evolution equation $u_t=a^{ij}(t)u_{x^ix^j} +b^i(t) u_{x^i} + c(t)u+f, \quad t>0, x\in \mathbb{R}^d$ given with the zero initial data. Here $a^{ij}(t)$, $b^i(t)$, $c(t)$ are merely locally…

Analysis of PDEs · Mathematics 2023-01-03 Ildoo Kim

Let $\mathcal{L}$ and $\mathcal{L}_0$ be the binary codes generated by the column $\mathbb{F}_2$-null space of the incidence matrix of external points versus passant lines and internal points versus secant lines with respect to a conic in…

Combinatorics · Mathematics 2011-04-05 Junhua Wu

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Combinatorics · Mathematics 2015-01-23 Volker Kaibel , Matthias Walter

In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…

Discrete Mathematics · Computer Science 2021-11-05 Elizabeth Hartung , Hung Phuc Hoang , Torsten Mütze , Aaron Williams

Let $p$ be an odd prime, $q=p^e$, $e\ge 1$, and $\mathbb{F} = \mathbb{F_q}$ denote the finite field of $q$ elements. Let $f: \mathbb{F}^2\to \mathbb{F}$ and $g: \mathbb{F}^3\to \mathbb{F}$ be functions, and let $P$ and $L$ be two copies of…

Combinatorics · Mathematics 2021-09-08 Felix Lazebnik , Vladislav Taranchuk

For a locally compact group $G$ and $p \in (1,\infty)$, we define $B_p(G)$ to be the space of all coefficient functions of isometric representations of $G$ on quotients of subspaces of $L_p$ spaces. For $p =2$, this is the usual…

Functional Analysis · Mathematics 2007-05-23 Volker Runde

We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an $n\times n$ 0-1 matrix $C,$ let $K_{C}$ be the complete weighted graph on the rows of $C$ where the weight of…

Data Structures and Algorithms · Computer Science 2014-01-28 Andrzej Lingas , Dzmitry Sledneu

We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…

High Energy Physics - Theory · Physics 2025-08-29 G. P. Korchemsky
‹ Prev 1 8 9 10 Next ›