اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the Ubiquity and Utility of Cyclic Schemes
437
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $k,l,m,n$, and $mu$ be positive integers. A $mathbb{Z}_mu$--{it scheme of valency} $(k,l)$ and {it order} $(m,n)$ is a $m times n$ array $(S_{ij})$ of subsets $S_{ij} subseteq mathbb{Z}_mu$ such that for each row and column one has $sum_{j=1}^n |S_{ij}| = k $ and $sum_{i=1}^m |S_{ij}| = l$, respectively. Any such scheme is an algebraic equivalent of a $(k,l)$-semi-regular bipartite voltage graph with $n$ and $m$ vertices in the bipartition sets and voltages coming from the cyclic group $mathbb{Z}_mu$. We are interested in the subclass of $mathbb{Z}_mu$--schemes that are characterized by the property $a - b + c - d; ot equiv ;0$ (mod $mu$) for all $a in S_{ij}$, $b in S_{ih}$, $c in S_{gh}$, and $d in S_{gj}$ where $i,g in {1,...,m}$ and $j,h in {1,...,n}$ need not be distinct. These $mathbb{Z}_mu$--schemes can be used to represent adjacency matrices of regular graphs of girth $ge 5$ and semi-regular bipartite graphs of girth $ge 6$. For suitable $rho, sigma in mathbb{N}$ with $rho k = sigma l$, they also represent incidence matrices for polycyclic $(rho mu_k, sigma mu_l)$ configurations and, in particular, for all known Desarguesian elliptic semiplanes. Partial projective closures yield {it mixed $mathbb{Z}_mu$-schemes}, which allow new constructions for Krv{c}adinacs sporadic configuration of type $(34_6)$ and Balbuenas bipartite $(q-1)$-regular graphs of girth 6 on as few as $2(q^2-q-2)$ vertices, with $q$ ranging over prime powers. Besides some new results, this survey essentially furnishes new proofs in terms of (mixed) $mathbb{Z}_mu$--schemes for ad-hoc constructions used thus far.
قيم البحث
اقرأ أيضاً
We study whether and how can we model a joint distribution $p(x,z)$ using two conditional models $p(x|z)$ and $q(z|x)$ that form a cycle. This is motivated by the observation that deep generative models, in addition to a likelihood model $p(x|z)$, of
ten also use an inference model $q(z|x)$ for data representation, but they rely on a usually uninformative prior distribution $p(z)$ to define a joint distribution, which may render problems like posterior collapse and manifold mismatch. To explore the possibility to model a joint distribution using only $p(x|z)$ and $q(z|x)$, we study their compatibility and determinacy, corresponding to the existence and uniqueness of a joint distribution whose conditional distributions coincide with them. We develop a general theory for novel and operable equivalence criteria for compatibility, and sufficient conditions for determinacy. Based on the theory, we propose the CyGen framework for cyclic-conditional generative modeling, including methods to enforce compatibility and use the determined distribution to fit and generate data. With the prior constraint removed, CyGen better fits data and captures more representative features, supported by experiments showing better generation and downstream classification performance.
Let $triangleleft$ be a relation between graphs. We say a graph $G$ is emph{$triangleleft$-ubiquitous} if whenever $Gamma$ is a graph with $nG triangleleft Gamma$ for all $n in mathbb{N}$, then one also has $aleph_0 G triangleleft Gamma$, where $alph
a G$ is the disjoint union of $alpha$ many copies of $G$. The emph{Ubiquity Conjecture} of Andreae, a well-known open problem in the theory of infinite graphs, asserts that every locally finite connected graph is ubiquitous with respect to the minor relation. In this paper, which is the first of a series of papers making progress towards the Ubiquity Conjecture, we show that all trees are ubiquitous with respect to the topological minor relation, irrespective of their cardinality. This answers a question of Andreae from 1979.
A graph $G$ is said to be $preceq$-ubiquitous, where $preceq$ is the minor relation between graphs, if whenever $Gamma$ is a graph with $nG preceq Gamma$ for all $n in mathbb{N}$, then one also has $aleph_0 G preceq Gamma$, where $alpha G$ is the dis
joint union of $alpha$ many copies of $G$. A well-known conjecture of Andreae is that every locally finite connected graph is $preceq$-ubiquitous. In this paper we give a sufficient condition on the structure of the ends of a graph~$G$ which implies that $G$ is $preceq$-ubiquitous. In particular this implies that the full grid is $preceq$-ubiquitous.
A graph $G$ is said to be ubiquitous, if every graph $Gamma$ that contains arbitrarily many disjoint $G$-minors automatically contains infinitely many disjoint $G$-minors. The well-known Ubiquity conjecture of Andreae says that every locally finite g
raph is ubiquitous. In this paper we show that locally finite graphs admitting a certain type of tree-decomposition, which we call an extensive tree-decomposition, are ubiquitous. In particular this includes all locally finite graphs of finite tree-width, and also all locally finite graphs with finitely many ends, all of which have finite degree. It remains an open question whether every locally finite graph admits an extensive tree-decomposition.
In a 1983 paper, G. Ramharter asks what are the extremal arrangements for the cyclic analogues of the regular and semi-regular continuants first introduced by T.S. Motzkin and E.G. Straus in 1956. In this paper we answer this question by showing that
for each set $A$ consisting of positive integers $1<a_1<a_2<cdots <a_k$ and a $k$-term partition $P: n_1+n_2 + cdots + n_k=n$, there exists a unique (up to reversal) cyclic word $x$ which maximizes (resp. minimizes) the regular cyclic continuant $K^{circlearrowright}(cdot)$ amongst all cyclic words over $A$ with Parikh vector $(n_1,n_2,ldots,n_k)$. We also show that the same is true for the minimizing arrangement for the semi-regular cyclic continuant $dot K^{circlearrowright}(cdot)$. As in the non-cyclic case, the main difficulty is to find the maximizing arrangement for the semi-regular continuant, which is not unique in general and may depend on the integers $a_1,ldots,a_k$ and not just on their relative order. We show that if a cyclic word $x$ maximizes $dot K^{circlearrowright}(cdot)$ amongst all permutations of $x$, then it verifies a strong combinatorial condition which we call the singular property. We develop an algorithm for constructing all singular cyclic words having a prescribed Parikh vector.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
