Hasil untuk "math.CO"

Menampilkan 20 dari ~2082506 hasil · dari CrossRef, arXiv, DOAJ

JSON API
CrossRef Open Access 2025
On particular integrability for (co)symplectic and (co)contact Hamiltonian systems

R Azuaje, A M Escobar-Ruiz

Abstract As a generalization and extension of our previous paper (Escobar-Ruiz and Azuaje 2024 J. Phys. A: Math. Theor. 57 105202), in this work, the notions of particular integral and particular integrability in classical mechanics are extended to the formalisms of cosymplectic, contact and cocontact geometries. This represents a natural framework for studying dissipative systems, enabling a reduction of the equations of motion and, in certain cases, allowing explicit solutions to be found within a subset of the overall dynamics where integrability conditions are met. Specifically, for Hamiltonian systems on cosymplectic, contact and cocontact manifolds, it is demonstrated that the existence of a particular integral allows us to find certain integral curves from a reduced, lower dimensional, set of Hamilton’s equations. In the case of particular integrability, these trajectories can be obtained by quadratures. Notably, for dissipative systems described by contact geometry, a particular integral can be viewed as a generalization of the important concept of dissipated quantity as well.

2 sitasi en
arXiv Open Access 2020
Detecting a long even hole

Linda Cook, Paul Seymour

For each integer $\ell \geq 4$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $\ell$ and even

en math.CO
arXiv Open Access 2020
On the enumeration of Hoppy's walks

Helmut Prodinger

The enumeration of k-Dyck paths ending at level j after m up-steps, where the last step is an up-step, is given as a sum, improving on a previous formula given by Deng and Mansour.

en math.CO
arXiv Open Access 2020
On the size of maximal intersecting families

Dmitrii Zakharov

We show that an $n$-uniform maximal intersecting family has size at most $e^{-n^{0.5+o(1)}}n^n$. This improves a recent bound by Frankl. The Spread Lemma of Alweiss, Lowett, Wu and Zhang plays an important role in the proof.

en math.CO
DOAJ Open Access 2020
Brick polytopes, lattices and Hopf algebras

Vincent Pilaud

Generalizing the connection between the classes of the sylvester congruence and the binary trees, we show that the classes of the congruence of the weak order on Sn defined as the transitive closure of the rewriting rule UacV1b1 ···VkbkW ≡k UcaV1b1 ···VkbkW, for letters a < b1,...,bk < c and words U,V1,...,Vk,W on [n], are in bijection with acyclic k-triangulations of the (n + 2k)-gon, or equivalently with acyclic pipe dreams for the permutation (1,...,k,n + k,...,k + 1,n + k + 1,...,n + 2k). It enables us to transport the known lattice and Hopf algebra structures from the congruence classes of ≡k to these acyclic pipe dreams, and to describe the product and coproduct of this algebra in terms of pipe dreams. Moreover, it shows that the fan obtained by coarsening the Coxeter fan according to the classes of ≡k is the normal fan of the corresponding brick polytope

Mathematics
DOAJ Open Access 2014
Signed tree associahedra

Vincent Pilaud

An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. J.-L. Loday gave a particularly elegant realization of the associahedron, which was then generalized in two directions: on the one hand to obtain realizations of graph associahedra, and on the other hand to obtain multiple realizations of the associahedron parametrized by a sequence of signs. The goal of this paper is to unify and extend these two constructions to signed tree associahedra.

Mathematics

Halaman 24 dari 104126