English
Related papers

Related papers: Recognizing cyclic matrices and a conjecture of J.…

200 papers

Let $S=(s_1,s_2,...,s_m,...)$ be a linear recurring sequence with terms in $GF(q^n)$ and $T$ be a linear transformation of $GF(q^n)$ over $GF(q)$. Denote $T(S)=(T(s_1),T(s_2),...,T(s_m),...)$. In this paper, we first present counter…

Information Theory · Computer Science 2009-12-03 Zhi-Han Gao , Fang-Wei Fu

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

Commutative Algebra · Mathematics 2021-09-14 Amir Jafari , Amin Najafi Amin

Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…

The classical Dirac theorem asserts that every graph $G$ on $n$ vertices with minimum degree $\delta(G) \ge \lceil n/2 \rceil$ is Hamiltonian. The lower bound of $\lceil n/2 \rceil$ on the minimum degree of a graph is tight. In this paper,…

Discrete Mathematics · Computer Science 2016-06-14 Yasemin Büyükçolak , Didem Gözüpek , Sibel Özkan , Mordechai Shalom

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

Group Theory · Mathematics 2013-10-22 John R. Britnell , Mark Wildon

Let $Y$ admit a rectangular Lefschetz decomposition of its derived category, and consider a cyclic cover $X\to Y$ ramified over a divisor $Z$. In a setting not considered by Kuznetsov and Perry, we define a subcategory $\mathcal{A}_Z$ of…

Algebraic Geometry · Mathematics 2023-12-11 Hannah Dell , Augustinas Jacovskis , Franco Rota

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

Combinatorics · Mathematics 2017-01-20 Xiang-dong Hou

If F is an automorphism of the spectral unit ball, we show that, in a neighborhood of any cyclic (i.e. non-derogatory) matrix of the ball, the map F can be written as conjugation by a holomorphically varying non singular matrix. This…

Complex Variables · Mathematics 2008-01-23 Pascal J. Thomas

We define the acyclic orientation polynomial of a graph to be the generating function for the sinks of its acyclic orientations. Stanley proved that the number of acyclic orientations is equal to the chromatic polynomial evaluated at $-1$…

Combinatorics · Mathematics 2020-08-25 Byung-Hak Hwang , Woo-Seok Jung , Kang-Ju Lee , Jaeseong Oh , Sang-Hoon Yu

An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…

Commutative Algebra · Mathematics 2025-05-06 Marie Amalore Nambi , Neeraj Kumar

A matching from a finite subset $A$ of an abelian group to another subset $B$ is a bijection $f:A\rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely determined by its multiplicity…

Combinatorics · Mathematics 2023-08-30 Mohsen Aliabadi , Khashayar Filom

The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…

Computational Complexity · Computer Science 2018-02-02 Maurice Chandoo

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

Combinatorics · Mathematics 2024-11-05 Kristóf Bérczi , Áron Jánosik , Bence Mátravölgyi

Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…

Algebraic Geometry · Mathematics 2007-05-23 Dan Abramovich , Kalle Karu , Kenji Matsuki , Jarosław Włodarczyk

For a collection $\mathbf{G}=\{G_1,\dots, G_s\}$ of not necessarily distinct graphs on the same vertex set $V$, a graph $H$ with vertices in $V$ is a $\mathbf{G}$-transversal if there exists a bijection $\phi:E(H)\rightarrow [s]$ such that…

Combinatorics · Mathematics 2023-09-07 Felix Joos , Jaehoon Kim

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

Combinatorics · Mathematics 2022-03-16 Gianira N. Alfarano , Karan Khathuria , Simran Tinani

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-02-03 Li-meng Xia , Caixia Shen

Suppose that $K$ is a field of characteristic 0, $K_a$ is its algebraic closure, $p$ is a prime, $q=p^r$ is a power prime. Suppose that $f(x) \in K[x]$ is a polynomial of degree $n > 4$ without multiple roots. Let us consider the…

Algebraic Geometry · Mathematics 2007-05-23 Yuri G. Zarhin

In 2012 the first named author conjectured that totally real quartic fields of fundamental discriminant are determined by the isometry class of the integral trace zero form; such conjecture was based on computational evidence and the analog…

Number Theory · Mathematics 2020-03-24 Guillermo Mantilla-Soler , Carlos Rivera-Guaca

An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to…

History and Overview · Mathematics 2018-08-15 Pietro Paparella