English
Related papers

Related papers: Peckness of Edge Posets

200 papers

We study basic properties of the category of smooth representations of a p-adic group G with coefficients in any commutative ring R in which p is invertible. Our main purpose is to prove that Hecke algebras are noetherian whenever R is ; a…

Representation Theory · Mathematics 2007-05-23 Jean-Francois Dat

In this note we show existence of bounded, transitive cocycles over a transitive action of a finitely generated group, and bounded, ergodic cocycles over an ergodic, probability preserving action of $\Bbb Z^d$.

Dynamical Systems · Mathematics 2021-04-14 Jon. Aaronson , Benjamin Weiss

We prove that the mapping class group of a closed surface acts ergodically on connected components of the representation variety corresponding to a connected compact Lie group.

Dynamical Systems · Mathematics 2007-05-23 Doug Pickrell , Eugene Z. Xia

Given a hypergraph $H=(V,E)$, define for every edge $e\in E$ a linear expression with arguments corresponding with the vertices. Next, let the polynomial $p_H$ be the product of such linear expressions for all edges. Our main goal was to…

Directed graphs can be partitioned in so-called passages. A passage P is a set of edges such that any two edges sharing the same initial vertex or sharing the same terminal vertex are both inside $P$ or are both outside of P. Passages were…

Discrete Mathematics · Computer Science 2013-04-04 Wil van der Aalst

A multi-graph $G$ on $n$ vertices is $(k,\ell)$-sparse if every subset of $n'\leq n$ vertices spans at most $kn'- \ell$ edges. $G$ is {\em tight} if, in addition, it has exactly $kn - \ell$ edges. For integer values $k$ and $\ell \in [0,…

Combinatorics · Mathematics 2007-05-23 Audrey Lee , Ileana Streinu

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

Combinatorics · Mathematics 2021-11-29 János Nagy , Péter Pál Pach , István Tomon

The central topic is this question: is a given $k$-\'etale algebra $\prod_lE_l/k$ the specialization of a given $k$-cover $f:X\rightarrow B$ at some point $t_0\in B(k)$? Our main tool is a {\it twisting lemma} that reduces the problem to…

Number Theory · Mathematics 2011-07-01 Pierre Dèbes , François Legrand

We prove that every hyperbolic curve with a faithful action of a non-cyclic $p$-group (with a few exceptions if $p=2$) has a twisted form of index $1$ which satisfies Grothendieck's section conjecture. Furthermore, we prove that for every…

Algebraic Geometry · Mathematics 2023-05-18 Giulio Bresciani

We study block designs which admit an automorphism group that is transitive on blocks and points, and leaves invariant every partition in a given finite poset of partitions of the point set. The full stabiliser $G$ of all the partitions in…

Group Theory · Mathematics 2025-12-19 Carmen Amarra , Alice Devillers , Cheryl E. Praeger

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

Combinatorics · Mathematics 2019-11-13 Heather A. Newman , Hector Miranda , Darren A. Narayan

We give a full classification of continuous flexible discrete axial cone-nets, which are called axial C-hedra. The obtained result can also be used to construct their semi-discrete analogs. Moreover, we identify a novel subclass within the…

Computational Geometry · Computer Science 2024-01-10 Georg Nawratil

We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.

Discrete Mathematics · Computer Science 2010-08-02 Jesse Gilbert

The edge geodesic cover problem of a graph $G$ is to find a smallest number of geodesics that cover the edge set of $G$. The edge $k$-general position problem is introduced as the problem to find a largest set $S$ of edges of $G$ such that…

Combinatorics · Mathematics 2022-07-18 Paul Manuel , R. Prabha , Sandi Klavzar

Let $G$ be a group of order $k$. We consider the algebra $M_k(\mathbb{C})$ of $k$ by $k$ matrices over the complex numbers and view it as a crossed product with respect to $G$ by embedding $G$ in the symmetric group $S_k$ via the regular…

Rings and Algebras · Mathematics 2015-06-03 Darrell Haile , Michael Natapov

Let $X=(V,E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X.$ A move applied to a configuration is to select a black edge…

Combinatorics · Mathematics 2009-10-30 Hau-wen Huang , Chih-wen Weng

We consider the coset poset associated with the families of proper subgroups, proper subgroups of finite index, and proper normal subgroups of finite index. We investigate under which conditions those coset posets have contractible…

Group Theory · Mathematics 2019-10-15 Kai-Uwe Bux , Cora Welsch

The inducibility of a graph $H$ measures the maximum number of induced copies of $H$ a large graph $G$ can have. Generalizing this notion, we study how many induced subgraphs of fixed order $k$ and size $\ell$ a large graph $G$ on $n$…

Combinatorics · Mathematics 2019-11-05 Noga Alon , Dan Hefetz , Michael Krivelevich , Mykhaylo Tyomkyn

We study a large family of generalized class groups of imaginary quadratic orders $O$ and prove that they act freely and (essentially) transitively on the set of primitively $O$-oriented elliptic curves over a field $k$ (assuming this set…

Let $G=(V(G),E(G))$ be a simple connected and undirected graph with vertex set $V(G)$ and edge set $E(G)$. A set $S \subseteq V(G)$ is a $dominating$ $set$ if for each $v \in V(G)$ either $v \in S$ or $v$ is adjacent to some $w \in S$. That…

Combinatorics · Mathematics 2015-03-19 Haoli Wang , Xirong Xu , Yuansheng Yang , Guoqing Wang
‹ Prev 1 3 4 5 6 7 10 Next ›