中文
相关论文

相关论文: Hyperdeterminants on semilattices

200 篇论文

We study the lattice of finite-index extensions of a given finitely generated subgroup $H$ of a free group $F$. This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of $H$.…

群论 · 数学 2018-04-25 Pedro Silva , Pascal Weil

We study semigroup algebras arising from lattice polytopes, compute their volume polynomials (particularizing work of Hochster), and establish strong Lefschetz properties (generalizing work of the first three authors). This resolves several…

Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…

符号计算 · 计算机科学 2010-02-03 Ioannis Z. Emiris , Angelos Mantzaflaris

Sharp upper and lower bounds for the second and third order Hermitian-Toepilitz determinants are obtained for some generalized subclasses of starlike and convex functions. Applications of these results are also discussed for several widely…

复变函数 · 数学 2022-10-25 Surya Giri , S. Sivaprasad Kumar

Cayley's first hyperdeterminant is a straightforward generalization of determinants for tensors. We prove that nonzero hyperdeterminants imply lower bounds on some types of tensor ranks. This result applies to the slice rank introduced by…

组合数学 · 数学 2021-07-20 Alimzhan Amanov , Damir Yeliussizov

We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.

数值分析 · 数学 2026-03-23 Michael S. Floater

We give an overview of known results about Hilbert matrices from the point of view of orthogonal polynomials and compute Hankel determinants of harmonic numbers and related topics.

经典分析与常微分方程 · 数学 2017-05-25 Johann Cigler

Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we…

数论 · 数学 2011-10-25 Mika Mattila , Pentti Haukkanen

Let $\mathcal{V}=\bigsqcup_{i=0}^n\mathcal{V}_i$ be the lattice of subspaces of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$ and let $\mathcal{A}$ be the graded Gorenstein algebra defined over $\mathbb{Q}$ which has…

组合数学 · 数学 2016-09-15 Saeed Nasseh , Alexandra Seceleanu , Junzo Watanabe

A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…

概率论 · 数学 2022-05-23 Patryk Pagacz , Michał Wojtylak

This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…

最优化与控制 · 数学 2024-03-08 Marcel Celaya , Stefan Kuhlmann , Robert Weismantel

We propose a method for constructing systems of polynomial equations that define submanifolds of degenerate binary forms of an arbitrary degeneracy degree. It is appropriate to call these systems of equations "higher discriminants".

代数几何 · 数学 2007-11-07 Sh. Shakirov

Let R be a complete discrete valuation ring with maximal ideal generated by pi. Let f(X) in R[X] be a monic polynomial with nonzero discriminant Delta(f). Let s >= v_pi(Delta(f)) + 1. Suppose given a factorisation of f(X) in (R/pi^s R)[X]…

交换代数 · 数学 2014-07-31 Juliane Deissler

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

数论 · 数学 2025-02-12 Aaron Manning , Alina Ostafe , Igor E. Shparlinski

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

组合数学 · 数学 2021-04-05 Elisa Palezzato , Michele Torielli

An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…

最优化与控制 · 数学 2026-05-26 Hao Hu , Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

In this paper, we give some determinantal and permanental representations of Generalized Lucas Polynomials by using various Hessenberg matrices, which are general form of determinantal and permanental representations of ordinary Lucas and…

数论 · 数学 2011-11-18 Kenan Kaygisiz , Adem Sahin

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…

组合数学 · 数学 2007-05-23 J. M. Brunat , C. Krattenthaler , A. Lascoux , A. Montes

In [{\it On the free implicative semilattice extension of a Hilbert algebra}. Mathematical Logic Quarterly 58, 3 (2012), 188--207], Celani and Jansana give an explicit description of the free implicative semilattice extension of a Hilbert…

逻辑 · 数学 2018-07-09 José L. Castiglioni , Hernán J. San Martín

We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas…

组合数学 · 数学 2018-06-28 Ho-Hon Leung