English
Related papers

Related papers: Cyclic classes and attraction cones in max algebra

200 papers

Let X be a smooth projective variety. Starting with a finite set of cycles on powers X^m of X, we consider the Q-vector subspaces of the Q-linear Chow groups of the X^m obtained by iterating the algebraic operations and pullback and push…

Algebraic Geometry · Mathematics 2010-03-26 Peter O'Sullivan

It is known that every matrix of order n over the maximal order in an algebraic number eld is a sum of k-th powers in various cases if a discriminant condition is satis ed. It has been proved by Wadikar and Katre that for every matrix of…

Number Theory · Mathematics 2025-10-16 S. A Katre , Deepa Krishnamurthi

As is well known, any complex cyclic matrix $A$ is similar to the unique companion matrix associated with the minimal polynomial of $A$. On the other hand, a cyclic matrix over a division ring $\mathbb F$ is similar to a companion matrix of…

Rings and Algebras · Mathematics 2021-12-07 Vladimir Bolotnikov

For any integer $k\ge 1$, we show that there are infinitely many complex quadratic fields whose 2-class groups are cyclic of order $2^k$. The proof combines the circle method with an algebraic criterion for a complex quadratic ideal class…

Number Theory · Mathematics 2012-11-13 Carlos Dominguez , Steven J. Miller , Siman Wong

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

Information Theory · Computer Science 2007-08-13 Heide Gluesing-Luerssen , Fai-Lung Tsang

We present a new technique for efficiently removing almost all short cycles in a graph without unintentionally removing its triangles. Consequently, triangle finding problems do not become easy even in almost $k$-cycle free graphs, for any…

Data Structures and Algorithms · Computer Science 2022-10-18 Amir Abboud , Karl Bringmann , Seri Khoury , Or Zamir

We prove that the sequence of eigencones (i.e., cones of nonnegative eigenvectors) of positive powers A^k of a nonnegative square matrix A is periodic both in max algebra and in nonnegative linear algebra. Using an argument of Pullman, we…

Rings and Algebras · Mathematics 2014-01-16 Peter Butkovic , Hans Schneider , Sergei Sergeev , Bit-Shun Tam

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

Discrete Mathematics · Computer Science 2017-05-02 Syed Mohammad Meesum

Glass networks are piecewise linear ODE systems that models an interactive system where there are 'switching points': the underlying dynamic changes qualitatively when a certain variable pass over a threshold. One of the most well-studied…

Dynamical Systems · Mathematics 2023-11-21 Huy K. Vo

Iteration of the quadratic map produces sequences of polynomials whose degrees {\sl explode} as the orbital period grows more and more. The polynomial mixing all 335 period-12 orbits has degree $4020$, while for the $52,377$ period-20…

Chaotic Dynamics · Physics 2020-10-09 Jason A. C. Gallas

There are few examples of non-autonomous vector fields exhibiting complex dynamics that may be proven analytically. We analyse a family of periodic perturbations of a weakly attracting robust heteroclinic network defined on the two-sphere.…

Dynamical Systems · Mathematics 2019-09-20 Isabel S. Labouriau , Alexandre A. P. Rodrigues

For a $p$-adic curve $X$, we study conditions under which all classes in the $n$-torsion of $Br(X)$ are $\mathbb{Z}/n$-cyclic. We show that in general not all classes are $\mathbb{Z}/n$-cyclic classes. On the other hand, if $X$ has good…

Rings and Algebras · Mathematics 2019-04-04 Eduardo Tengan

We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border)…

Computational Complexity · Computer Science 2015-03-11 Fulvio Gesmundo , Jonathan Hauenstein , Christian Ikenmeyer , JM Landsberg

We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…

Data Structures and Algorithms · Computer Science 2019-04-29 Samuel Haney , Mehraneh Liaee , Bruce M. Maggs , Debmalya Panigrahi , Rajmohan Rajaraman , Ravi Sundaram

We consider the space of $C^1$-diffeomorphims equipped with the $C^1$-topology on a three dimensional closed manifold. It is known that there are open sets in which $C^1$-generic diffeomorphisms display uncountably many chain recurrences…

Dynamical Systems · Mathematics 2022-09-28 Christian Bonatti , Katsutoshi Shinohara

We present an approach to cyclic homology of A_{\infty} algebras. Our main technical tool is the concept of X-complex due to Cuntz and Quillen. This, in particular, enables us to compute the periodic cyclic homology of an A_{\infty} algebra…

Quantum Algebra · Mathematics 2007-05-23 Masoud Khalkhali

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

Dynamical Systems · Mathematics 2012-08-29 James T. Campbell , Jared T. Collins

This paper is a significant part of a general project aimed to classify all irreducible representations of finite quasi-simple groups over an algebraically closed field, in which the image of at least one element is represented by an almost…

Group Theory · Mathematics 2016-12-08 L. Di Martino , A. E. Zalesski

The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…

Data Structures and Algorithms · Computer Science 2024-03-12 R. Krithika , V. K. Kutty Malu , Prafullkumar Tale

Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…

Representation Theory · Mathematics 2023-03-14 Miranda C. N. Cheng , John F. R. Duncan , Michael H. Mertens