English
Related papers

Related papers: The density of uncyclic matrices

200 papers

A matrix is called Bohemian if its entries are sampled from a finite set of integers. We determine the maximum absolute determinant of upper Hessenberg Bohemian Matrices for which the subdiagonal entries are fixed to be $1$ and upper…

Symbolic Computation · Computer Science 2020-05-12 Jonathan P. Keating , Ahmet Abdullah Keleş

We show that, if $M$ is a simple rank-$n$ matroid with no $\ell$-point line minor and no minor isomorphic to the cycle matroid of a $t$-vertex complete graph, then the ratio $|M| / n$ is bounded above by a singly exponential function of…

Combinatorics · Mathematics 2023-06-28 Peter Nelson , Sergey Norin , Fernanda Rivera Omana

A radially weighted Besov space $H$ is a space of holomorphic functions on the unit ball $\mathbb{B}_d \subseteq \mathbb{C}^d$ whose $N$-th radial derivative is square integrable with respect to a given admissible radial measure. We write…

Functional Analysis · Mathematics 2026-05-06 Anusrika Datta , Stefan Richter

In this article, we count the quantity of minimal cyclic codes of length $n$ and dimension $k$ over a finite field $\mathbb F_q$, in the case when the prime factors of $n$ satisfy a special condition. This problem is equivalent to count the…

Information Theory · Computer Science 2014-06-18 F. E. Brochero Martínez

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…

Computational Complexity · Computer Science 2013-02-12 Bruno Grenet , Pascal Koiran , Natacha Portier

Within the framework of inverse seesaw mechanism we investigate neutrino mass matrices invariant under cyclic symmetry ($Z_3$) with maximal zero texture (6 zero textures). We explore two different approaches to obtain the cyclic symmetry…

High Energy Physics - Phenomenology · Physics 2016-10-12 Rome Samanta , Ambar Ghosal

We consider the convolution model where i.i.d. random variables $X_i$ having unknown density $f$ are observed with additive i.i.d. noise, independent of the $X$'s. We assume that the density $f$ belongs to either a Sobolev class or a class…

Statistics Theory · Mathematics 2009-09-29 Cristina Butucea

Given a dynamical system $(X,T)$ and a family $\mathsf{I}\subseteq \mathcal{P}(\omega)$ of "small" sets of nonnegative integers, a point $x \in X$ is said to be $\mathsf{I}$-strong universal if for each $y \in X$ there exists a subsequence…

Functional Analysis · Mathematics 2025-05-12 Paolo Leonetti

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Algebraic Geometry · Mathematics 2019-11-06 Adrien Poteaux , Martin Weimann

An $n\times n$ matrix $M$ is called a \textit{fooling-set matrix of size $n$} if its diagonal entries are nonzero and $M_{k,\ell} M_{\ell,k} = 0$ for every $k\ne \ell$. Dietzfelbinger, Hromkovi{\v{c}}, and Schnitger (1996) showed that $n…

Combinatorics · Mathematics 2014-01-17 Mirjam Friesen , Aya Hamed , Troy Lee , Dirk Oliver Theis

The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization.…

Machine Learning · Statistics 2017-12-12 David W Dreisigmeyer

For a commutative ring $S$ and self-orthogonal subcategory $\mathsf{C}$ of $\mathsf{Mod}(S)$, we consider matrix factorizations whose modules belong to $\mathsf{C}$. Let $f\in S$ be a regular element. If $f$ is $M$-regular for every $M\in…

Commutative Algebra · Mathematics 2019-12-04 Petter Andreas Bergh , Peder Thompson

Nonnegative matrix factorization is the following problem: given a nonnegative input matrix $V$ and a factorization rank $K$, compute two nonnegative matrices, $W$ with $K$ columns and $H$ with $K$ rows, such that $WH$ approximates $V$ as…

Optimization and Control · Mathematics 2025-01-10 Valentin Leplat , Yurii Nesterov , Nicolas Gillis , François Glineur

We consider pinching cocycles taking values in the space of homeomorphisms of the circle over an hyperbolic base. Using the Invariance Principle of Malicet, we prove that the cocycles having non-zero exponents of contraction are dense. In…

Dynamical Systems · Mathematics 2022-12-27 Catalina Freijo , Karina Marin

We give an almost-complete description of orthogonal matrices $M$ of order $n$ that "rotate a non-negligible fraction of the Boolean hypercube $C_n=\{-1,1\}^n$ onto itself," in the sense that $$P_{x\in C_n}(Mx\in C_n) \ge n^{-C},\mbox{ for…

Combinatorics · Mathematics 2014-10-13 Scott Aaronson , Hoi Nguyen

Let M be a matrix whose entries are power series in several variables and determinant det(M) does not vanish identically. The equation det(M)=0 defines a hypersurface singularity and the (co)-kernel of M is a maximally Cohen-Macaulay module…

Algebraic Geometry · Mathematics 2011-12-22 Dmitry Kerner , Victor Vinnikov

Let R be an n-dimensional Cohen-Macaulay local ring and Q a parameter ideal of R. Suppose that an acyclic complex (F_{\bullet}, \varphi_{\bullet}) of length n of finitely generated free R-modules is given. We put M = Im \varphi_{1}, which…

Commutative Algebra · Mathematics 2013-12-13 Taro Inagawa

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

Combinatorics · Mathematics 2022-12-06 Jie Ma , Tianchi Yang

Bayes factors are widely computed by Monte Carlo, yet heavy-tailed sampling distributions can make numerical validation unreliable. The Turing--Good identities provide exact moment equalities for powers of a Bayes factor (a density ratio).…

Methodology · Statistics 2026-02-24 Kensuke Okada

Let $F$ be a field and $M_n(F)$ the ring of $n \times n$ matrices over $F$. Given a subset $S$ of $M_n(F)$, the null ideal of $S$ is the set of all polynomials $f$ with coefficients from $M_n(F)$ such that $f(A) = 0$ for all $A \in S$. We…

Rings and Algebras · Mathematics 2023-01-02 Eric Swartz , Nicholas J. Werner