English
Related papers

Related papers: The Determinant of $\{\pm 1\}$-Matrices and Orient…

200 papers

A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…

Commutative Algebra · Mathematics 2014-09-16 Maral Mostafazadehfard , Aron Simis

The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite…

Computational Complexity · Computer Science 2011-11-09 Guohun Zhu

We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…

Commutative Algebra · Mathematics 2026-01-09 Lisa Nicklasson , Manolis C. Tsakiris

We present a simple, yet useful result about the expected value of the determinant of random sum of rank-one matrices. Computing such expectations in general may involve a sum over exponentially many terms. Nevertheless, we show that an…

Data Structures and Algorithms · Computer Science 2020-03-24 Kasra Khosoussi

Identifying influential nodes and edges in directed networks remains a fundamental challenge across domains from social influence to biological regulation. Most existing centrality measures face a critical limitation: they either discard…

Social and Information Networks · Computer Science 2026-02-18 Jorge Luiz Franco , Thomas Peron , Alcebiades Dal Col , Fabiano Petronetto , Filipe Alves Neto Verri , Eric K. Tokuda , Luiz Gustavo Nonato

In our previous work, we introduced the following relaxation of the Hadamard property: a square matrix $H\in M_N(\mathbb R)$ is called "almost Hadamard" if $U=H/\sqrt{N}$ is orthogonal, and locally maximizes the 1-norm on O(N). We review…

Combinatorics · Mathematics 2013-09-17 Teodor Banica , Ion Nechita

This work explores the definiteness of the weighted graph Laplacian matrix with negative edge weights. The definiteness of the weighted Laplacian is studied in terms of certain matrices that are related via congruent and similarity…

Optimization and Control · Mathematics 2015-03-03 Daniel Zelazo , Mathias Bürger

One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time complexity of its algorithm. Among all definitions of determinant of rectangular matrices, used definition has special features which make…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-08-07 Neda Abdollahi , Mohammad Jafari , Morteza Bayat , Ali Amiri , Mahmood Fathy

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

Symbolic Computation · Computer Science 2021-04-12 Vincent Neiger , Clément Pernet

A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…

Algebraic Geometry · Mathematics 2012-09-19 Dmitry Kerner , Victor Vinnikov

Due to their rich algebraic structures and various applications, circulant matrices have been of interest and continuously studied. In this paper, the notions of Binomial-related matrices have been introduced. Such matrices are circulant…

Rings and Algebras · Mathematics 2018-04-05 Trairat Jantaramas , Somphong Jitman , Pornpan Kaewsaard

On a periodic planar graph whose edge weights satisfy a certain simple geometric condition, the discrete Laplacian and d-bar operators have the property that their determinants and inverses only depend on the local geometry of the graph. We…

Mathematical Physics · Physics 2015-06-26 Richard Kenyon

We evaluate determinants of "spiral" matrices, which are matrices in which entries are spiralling from the centre of the matrices towards the outside, with prescribed increments from one entry to the next depending on whether one moves…

Combinatorics · Mathematics 2017-06-06 Gaurav Bhatnagar , Christian Krattenthaler

This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…

Rings and Algebras · Mathematics 2011-12-22 Philip D. Powell

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…

Data Structures and Algorithms · Computer Science 2010-02-03 Andreas Björklund

The main contribution of this paper is a six-step semi-automatic algorithm that obtains a recursion satisfied by a family of determinants by systematically and iteratively applying Laplace expansion to the underlying matrix family. The…

Combinatorics · Mathematics 2024-06-25 Emily J. Evans , Russell J. Hendel

We generalise the Vandermonde determinant identity to one which tests whether a family of hypersurfaces in $\mathbf{P}^n$ has an unexpected intersection point.

Commutative Algebra · Mathematics 2024-05-07 Itaï Ben Yaacov

Given $n+1$ unit vectors in $\mathbf{R}^n$ or $\mathbf{C}^n,$ consider the absolute values of the determinants of the vectors taken $n$ at a time. By taking a geometric perspective, we show that the minimum of these determinants is…

Metric Geometry · Mathematics 2016-08-23 Mark Fincher

For a prime power $q$, we study the distribution of determinent of matrices with restricted entries over a finite field $\mathbbm{F}_q$ of $q$ elements. More precisely, let $N_d (\mathcal{A}; t)$ be the number of $d \times d$ matrices with…

Combinatorics · Mathematics 2009-03-17 Le Anh Vinh

We develop a general theory of "almost Hadamard matrices". These are by definition the matrices $H\in M_N(\mathbb R)$ having the property that $U=H/\sqrt{N}$ is orthogonal, and is a local maximum of the 1-norm on O(N). Our study includes a…

Combinatorics · Mathematics 2013-02-19 Teodor Banica , Ion Nechita , Karol Zyczkowski
‹ Prev 1 4 5 6 7 8 10 Next ›