中文
相关论文

相关论文: Equable Parallelograms on the Eisenstein Lattice

200 篇论文

We reduce CR-structures on smooth elliptic and hyperbolic manifolds of CR-codimension 2 to parallelisms thus solving the problem of global equivalence for such manifolds. The parallelism that we construct is defined on a sequence of two…

复变函数 · 数学 2007-05-23 V. V. Ezhov , A. V. Isaev , G. Schmalz

Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each…

计算几何 · 计算机科学 2007-05-23 Martin Kutz

Continual Lie algebras are infinite-dimensional generalizations of Lie algebras with discrete root system by considering continual root systems. In this paper we establish the general relation between chain complexes and continual Lie…

泛函分析 · 数学 2026-05-20 A. Zuevsky

We study the degree of non-homogeneous lattice ideals over arbitrary fields, and give formulae to compute the degree in terms of the torsion of certain factor groups of Z^s and in terms of relative volumes of lattice polytopes. We also…

交换代数 · 数学 2014-03-24 Liam O'Carroll , Francesc Planas-Vilanova , Rafael H. Villarreal

We construct perfect t-embeddings for regular hexagons of the hexagonal lattice, providing the first example, and hence proving existence, for graphs with an outer face of degree greater than four. The construction is in terms of the…

概率论 · 数学 2024-08-13 Tomas Berggren , Matthew Nicoletti , Marianna Russkikh

Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…

计算机科学中的逻辑 · 计算机科学 2010-01-14 Dietrich Kuske , Jiamou Liu , Markus Lohrey

We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…

度量几何 · 数学 2017-10-26 Jeff Lindquist

We prove that an irreducible lattice in a semisimple algebraic group is virtually isomorphic to an arithmetic lattice if and only if it admits a faithful self-similar action on a rooted tree of finite valency.

群论 · 数学 2008-09-05 Michael Kapovich

Lattice systems with certain Lie algebraic or quantum Lie algebraic symmetries are constructed. These symmetric models give rise to series of integrable systems. As examples the $A_n$-symmetric chain models and the SU(2)-invariant ladder…

量子物理 · 物理学 2007-05-23 Sergio Albeverio , Shao-Ming Fei

Let $G$ be an undirected simple connected graph. We say a vertex $u$ is eccentric to a vertex $v$ in $G$ if $d(u,v)=\max\{d(v,w): w\in V(G)\}$. The eccentric graph, $E(G)$ of $G$ is a graph defined on the same vertex set as of $G$ and two…

组合数学 · 数学 2023-09-13 Anita Arora , Rajiv Mishra

We study almost complex structures on parallelizable manifolds via the rank of their Nijenhuis tensor. First, we show how the computations of such rank can be reduced to finding smooth functions on the underlying manifold solving a system…

微分几何 · 数学 2025-11-12 Lorenzo Sillari , Adriano Tomassini

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

组合数学 · 数学 2012-12-27 Tyler Friesen , Vassily Manturov

We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…

度量几何 · 数学 2020-02-18 Oleksiy Dovgoshey

A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…

组合数学 · 数学 2024-04-26 Georg Grasegger , Jan Legerský

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

组合数学 · 数学 2022-06-14 Valerii Sopin

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…

组合数学 · 数学 2012-01-31 Ricky Ini Liu

We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…

算子代数 · 数学 2024-05-09 Paul Meunier

We compute the A-infinity structure on the self-Ext algebra of the vector bundle $G$ over an elliptic curve of the form $G=\bigoplus_{i=1}^r P_i\oplus \bigoplus_{j=1}^s L_j$, where $(P_i)$ and $(L_j)$ are line bundles of degrees 0 and 1,…

代数几何 · 数学 2016-05-24 Alexander Polishchuk

Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…

数学物理 · 物理学 2016-01-19 Ram Band , Adam Sawicki , Uzy Smilansky

We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. Our randomized low depth algorithm has a…

数据结构与算法 · 计算机科学 2020-07-03 Lukas Gianinazzi , Torsten Hoefler