English
Related papers

Related papers: On the Equivalence of Three Complete Cyclic System…

200 papers

We construct an anticyclotomic Euler system for the Rankin-Selberg convolution of two modular forms, using $p$-adic families of generalized Gross-Kudla-Schoen diagonal cycles. As applications of this construction, we prove new cases of the…

Number Theory · Mathematics 2023-05-18 Raúl Alonso , Francesc Castella , Óscar Rivero

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Combinatorics · Mathematics 2020-07-10 Sanjay Ramassamy

We introduce the cyclic major index of a cycle permutation and give a bivariate analogue of enumerative formula for the cyclic shuffles with a given cyclic descent numbers due to Adin, Gessel, Reiner and Roichman, which can be viewed as a…

Combinatorics · Mathematics 2022-05-10 Kathy Q. Ji , Dax T. X. Zhang

We present a comparison between the anticyclotomic Euler system of diagonal cycles associated with the convolution of two modular forms and the cyclotomic Beilinson--Flach Euler system. This extends the seminal work of Bertolini, Darmon,…

Number Theory · Mathematics 2025-09-10 Raúl Alonso , Lois Omil-Pazos , Óscar Rivero

In this paper we ivestigate St\"ackel transforms between different classes of parameter-dependent St\"ackel separable systems of the same dimension. We show that the set of all St\"ackel systems of the same dimension splits to equivalence…

Exactly Solvable and Integrable Systems · Physics 2018-04-10 Maciej Blaszak , Krzysztof Marciniak

In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…

Combinatorics · Mathematics 2015-04-14 Shi-Mei Ma , Yeong-Nan Yeh

In this paper, we characterize a duality relation between Eulerian recurrences and Eulerian recurrence systems, which generalizes and unifies Hermite-Biehler decompositions of several enumerative polynomials, including flag descent…

Combinatorics · Mathematics 2020-10-20 Shi-Mei Ma , Jun Ma , Jean Yeh , Yeong-Nan Yeh

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

Combinatorics · Mathematics 2025-02-07 Ron M. Adin , Pál Hegedűs , Yuval Roichman

We prove that two cusps of the same dimension in the Baily-Borel compactification of some classical series of modular varieties are linearly dependent in the rational Chow group of the compactification. This gives a higher dimensional…

Algebraic Geometry · Mathematics 2020-07-29 Shouhei Ma

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

Combinatorics · Mathematics 2025-09-30 Lotrenzo Mella , Gloria Rinaldi

A Bicycle $(n,k)$-gon is an equilateral $n$-gon whose $k$ diagonals are of equal length. In this paper we consider periodic bicycle $(n,k)$-paths, which are a natural variation in which the polygon is replaced with a periodic polygonal…

Dynamical Systems · Mathematics 2013-08-28 I. Alevy , E. Tsukerman

We relate Leibniz homology to cyclic homology by studying a map from a long exact sequence in the Leibniz theory to the ISB periodicity sequence in the cyclic theory. This provides a setting by which the two theories can be compared via the…

K-Theory and Homology · Mathematics 2007-05-23 Jerry Lodder

We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…

Combinatorics · Mathematics 2021-08-31 Samuel Herman , Eirini Poimenidou

We investigate Eisenstein congruences between the so-called Euler systems of Garrett--Rankin--Selberg type. This includes the cohomology classes of Beilinson--Kato, Beilinson--Flach and diagonal cycles. The proofs crucially rely on…

Number Theory · Mathematics 2023-06-08 Óscar Rivero , Victor Rotger

The main purpose of this paper is to study two scaling methods developed respectively by Pinchuk and Frankel. We introduce first a continuously-varying global coordinate system, and give an alternative proof to the convergence of Pinchuk's…

Complex Variables · Mathematics 2016-07-25 Seungro Joo

For a simplicial complex X on {1,2, ..., n} we define enriched homology and cohomology modules. They are graded modules over k[x_1, ..., x_n] whose ranks are equal to the dimensions of the reduced homology and cohomology groups. We…

Combinatorics · Mathematics 2011-12-14 Gunnar Floystad

We prove that there is a map from Bloch's cycle complex to Kato's complex of Milnor K-theory, which induces a quasi-isomorphism from \'{e}tale sheafified cycle complex to the Gersten complex of logarithmic de Rham--Witt sheaves. Next we…

Algebraic Geometry · Mathematics 2015-08-05 Changlong Zhong

Linearly repetitive Delone sets are shown to be rectifiable by a bi-Lipschitz homeomorphisms of the Euclidean space that sends the Delone set to the set of points with integer coordinates.

Metric Geometry · Mathematics 2016-03-02 Andrés Navas

A Skolem sequence of order n is a sequence S_n=(s_{1},s_{2},...,s_{2n}) of 2n integers containing each of the integers 1,2,...,n exactly twice, such that two occurrences of the integer j in {1,2,...,n} are separated by exactly j-1 integers.…

Combinatorics · Mathematics 2013-03-18 Nabil Shalaby , Daniela Silvesan

The understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical systems. In this paper, we make a step further in this…

Formal Languages and Automata Theory · Computer Science 2014-02-19 Tarek Melliti , Mathilde Noual , Damien Regnault , Sylvain Sené , Jérémy Sobieraj
‹ Prev 1 2 3 10 Next ›