English
Related papers

Related papers: Computations associated with the resonance arrange…

200 papers

The method of calculation of the resonance characteristics is developed for the metastable states of the Coulomb three-body (CTB) system with two disintegration channels. The energy dependence of K-matrix in the resonance region is…

Quantum Physics · Physics 2009-11-11 D. I. Abramov , V. V. Gusev

We study Betti numbers of sequences of Riemannian manifolds which Benjamini-Schramm converge to their universal covers. Using the Price inequalities we developed elsewhere, we derive two distinct convergence results. First, under a negative…

Differential Geometry · Mathematics 2024-10-29 Luca F. Di Cerbo , Mark Stern

Symmetric polynomials of the roots of a polynomial can be written as polynomials of the coefficients, and by applying this to the characteristic polynomial we can write a symmetric polynomial of the eigenvalues $a_{i}$ of an $n\times n$…

Combinatorics · Mathematics 2020-09-22 Jules Jacobs

Given integers $a_1, a_2, ..., a_n$, with $a_1 + a_2 + ... + a_n \geq 1$, a symmetrically constrained composition $\lambda_1 + lambda_2 + ... + lambda_n = M$ of $M$ into $n$ nonnegative parts is one that satisfies each of the the $n!$…

Combinatorics · Mathematics 2013-11-08 Matthias Beck , Ira M. Gessel , Sunyoung Lee , Carla D. Savage

Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…

Commutative Algebra · Mathematics 2016-02-09 Mina Bigdeli , Jürgen Herzog , Ali Akbar Yazdan Pour , Rashid Zaare-Nahandi

Hyperquot schemes are generalizations of Grothendieck's Quot scheme to partial flags. Using a Bialynicki-Birula decomposition, we obtain combinatorial data for the Betti numbers, and collect this information into the form of rational…

Algebraic Geometry · Mathematics 2007-05-23 Linda Chen

We consider resonances for third order ordinary differential operator with compactly supported coefficients on the real line. Resonance are defined as zeros of a Fredholm determinant on a non-physical sheet of three sheeted Riemann surface.…

Mathematical Physics · Physics 2016-05-09 Evgeny Korotyaev

We consider asymptotic behavior of the correlation functions of the characteristic polynomials of the hermitian sample covariance matrices $H_n=n^{-1}A_{m,n}^*A_{m,n}$, where $A_{m,n}$ is a $m\times n$ complex matrix with independent and…

Mathematical Physics · Physics 2011-05-19 T. Shcherbina

We develop algebro-combinatorial tools for computing the Thom polynomials for the Morin singularities $A_i(-)$ ($i\ge 0$). The main tool is the function $F^{(i)}_r$ defined as a combination of Schur functions with certain numerical…

Algebraic Geometry · Mathematics 2008-10-15 Piotr Pragacz

The energy levels of quantum systems are determined by quantization conditions. For one-dimensional anharmonic oscillators, one can transform the Schrodinger equation into a Riccati form, i.e., in terms of the logarithmic derivative of the…

Mathematical Physics · Physics 2013-09-10 Ulrich D. Jentschura , Jean Zinn-Justin

An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…

Computational Complexity · Computer Science 2015-03-20 Philon Nguyen

We study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the average number of redundant bits incurred by our schemes. In…

Information Theory · Computer Science 2023-07-04 Duc Tu Dao , Han Mao Kiah , Tuan Thanh Nguyen

A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In…

Combinatorics · Mathematics 2021-01-20 Jazmín Mantilla , Wilson Olaya-León , José L. Ramírez

The discriminantal arrangement $\mathcal{B}(n,k,\mathcal{A})$ has been introduced by Manin and Schectman in 1989 and it consists of all non-generic translates of a generic arrangement $\mathcal{A}$ of n hyperplanes in a $k$-dimensional…

Combinatorics · Mathematics 2025-09-23 Takuya Saito , Simona Settepanella

A {\it superpattern} is a string of characters of length $n$ that contains as a subsequence, and in a sense that depends on the context, all the smaller strings of length $k$ in a certain class. We prove structural and probabilistic results…

Combinatorics · Mathematics 2016-03-08 Yonah Biers-Ariel , Yiguang Zhang , Anant Godbole

In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…

Number Theory · Mathematics 2017-12-12 Taekyun Kim , Dae san Kim

We study the trapezoidal rule for periodic functions on uniform grids and show that the quadrature error exhibits a rich deterministic structure, beyond traditional asymptotic or statistical interpretations. Focusing on the prototype…

General Mathematics · Mathematics 2025-05-06 William Cook

Hetyei recently introduced a hyperplane arrangement (called the homogenized Linial arrangement) and used the finite field method of Athanasiadis to show that its number of regions is a median Genocchi number. These numbers count a class of…

Combinatorics · Mathematics 2019-05-14 Alexander Lazar , Michelle L. Wachs

Topological data analysis (TDA) is a rapidly growing area that applies techniques from algebraic topology to extract robust features from large-scale data. A key task in TDA is the estimation of (normalized) Betti numbers, which capture…

Quantum Physics · Physics 2026-04-30 Nhat A. Nghiem , Tzu-Chieh Wei

The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen…

Probability · Mathematics 2016-02-04 Dmitry Krachun , Yuri Yakubovich