English
Related papers

Related papers: Homology in Combinatorial Refraction Billiards

200 papers

We introduce and study several random combinatorial billiard trajectories. Such a system, which depends on a fixed parameter $p\in(0,1)$, models a beam of light that travels in a Euclidean space, occasionally randomly reflecting off of a…

Probability · Mathematics 2024-06-13 Colin Defant

Ballistic transport through a collection of quantum billiards in undoped graphene is studied analytically within the conformal mapping technique. The billiards show pseudodiffusive behavior, with the conductance equal to that of a classical…

Mesoscale and Nanoscale Physics · Physics 2009-09-18 Adam Rycerz , Patrik Recher , Michael Wimmer

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

Group Theory · Mathematics 2015-06-03 R. Rajkumar , P. Devi

Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the…

Combinatorics · Mathematics 2013-07-23 Alireza Abdollahi , Shahrooz Janbaz , Mohammad Reza Oboudi

In this paper, we continue to study billiards inside cones $K\subset \mathbb{R}^n$ over strictly convex closed $C^3$ manifolds with non-degenerate second fundamental form. Recently we proved that the billiard is superintegrable, i.e., the…

Dynamical Systems · Mathematics 2026-03-31 Andrey E. Mironov , Siyao Yin

The orbit closure of the unfolding of every rational right and isosceles triangle is computed and the asymptotic number of periodic billiard trajectories in these triangles is deduced. This follows by classifying all orbit closures of rank…

Dynamical Systems · Mathematics 2021-10-15 Paul Apisa

Defocusing mechanism provides a way to construct chaotic (hyperbolic) billiards with focusing components by separating all regular components of the boundary of a billiard table sufficiently far away from each focusing component. If all…

Dynamical Systems · Mathematics 2024-04-02 Leonid Bunimovich , Hong-Kun Zhang , Pengfei Zhang

A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…

Computational Geometry · Computer Science 2017-05-09 Radoslav Fulek

We study the effect of edge diffraction on the semiclassical analysis of two dimensional quantum systems by deriving a trace formula which incorporates paths hitting any number of vertices embedded in an arbitrary potential. This formula is…

chao-dyn · Physics 2009-10-28 Henrik Bruus , Niall D. Whelan

In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…

Combinatorics · Mathematics 2012-06-28 Jon Schneider

We consider the outer billiards map with contraction outside polygons. We construct a 1-parameter family of systems such that each system has an open set in which the dynamics is reduced to that of a piecewise contraction on the interval.…

Dynamical Systems · Mathematics 2015-01-26 In-Jee Jeong

We study billiards on polytopes in $\Rr^d$ with contracting reflection laws, i.e. non-standard reflection laws that contract the reflection angle towards the normal. We prove that billiards on generic polytopes are uniformly hyperbolic…

Dynamical Systems · Mathematics 2016-11-08 Pedro Duarte , José Pedro Gaivão , Mohammad Soufi

In this paper we consider $r$-regular graphs $G$ that admit the vertex set partition such that one of the induced subgraphs is the join of an $s$-vertex clique and a $t$-vertex co-clique and represents a star complement for an eigenvalue…

Combinatorics · Mathematics 2022-01-24 Yuhong Yang , Jianfeng Wang , Qiongxiang Huang , Zoran Stanic

Work of Glover and Huneke shows that a cubic graph embeds into the real projective plane if and only if it does not contain one of six topological minors called cubic projective plane obstructions. Here we classify up to equivalence the…

Combinatorics · Mathematics 2024-10-01 Marie Kramer

In this paper we study the homotopical rotation vectors and the homotopical rotation sets for the billiard flow on the unit flat torus with three, mutually intersecting and mutually orthogonal cylindrical scatterers removed from it. The…

Dynamical Systems · Mathematics 2017-08-18 Caleb C. Moxley , Nandor J. Simanyi

We consider billiard systems within compact domains bounded by confocal conics on a hyperboloid of one sheet in the Minkowski space. We derive conditions for elliptic periodicity for such billiards. We describe the topology of those…

Dynamical Systems · Mathematics 2021-08-31 Vladimir Dragovic , Sean Gasiorek , Milena Radnovic

Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $\mathbf{1}$ be the all-ones vector. We call $G$ controllable if the set of vectors $\mathbf{1}, A\mathbf{1}, \dots, A^{n-1}\mathbf{1}$ spans the whole space…

Combinatorics · Mathematics 2023-09-12 Aida Abiad , Anuj Dawar , Octavio Zapata

Let $f: [0, +\infty) \to (0, +\infty)$ be a sufficiently smooth convex function, vanishing at infinity. Consider the planar domain $Q$ delimited by the positive $x$-semiaxis, the positive $y$-semiaxis, and the graph of $f$. Under certain…

Chaotic Dynamics · Physics 2007-05-23 Marco Lenci

Given a $d$-dimensional torus map $F(z)=Mz+G(z)\bmod 1$, where $M$ is an integer-matrix and and $G$ is a periodic function, we find conditions on $M$ under which $F$ is semi-conjugate to a linear torus map, independently of $G$. We also…

Dynamical Systems · Mathematics 2018-01-31 Suddhasattwa Das , James Yorke

Let $n$ be any positive integer, the friendship graph $F_n$ consist of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same…

Combinatorics · Mathematics 2014-01-13 Alireza Abdollahi , Shahrooz Janbaz
‹ Prev 1 3 4 5 6 7 10 Next ›