English
Related papers

Related papers: On p-ary Bent Functions and Strongly Regular Graph…

200 papers

This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…

Combinatorics · Mathematics 2010-03-02 Norman Biggs

In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}nik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of…

Combinatorics · Mathematics 2023-08-29 Xiongfeng Zhan , Lu Lu , Xueyi Huang

In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group $D_n=\langle a,b\mid a^n=b^2=1,bab=a^{-1}\rangle$. Moreover, we also obtain some simple sufficient conditions for the…

Combinatorics · Mathematics 2016-06-08 Lu Lu , Qiongxiang Huang , Xueyi Huang

We address a question posed by Fessler-Jensen-Kelsey-Owen regarding graphs whose second gonality is greater than the first by exactly 1. We answer the question affirmatively under a stronger condition, thereby characterising the entire…

Combinatorics · Mathematics 2025-11-25 Šimun Dropuljić , Yoav Len

A variety of different orthogonal wavelet bases has been found in L_2(R) for the last three decades. It appeared that similar constructions also exist for functions defined on some other algebraic structures, such as the Cantor and Vilenkin…

Functional Analysis · Mathematics 2013-12-30 S. Evdokimov , M. Skopina

A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1 ,lambda_2, m, n) if its vertex set can be partitioned into m classes of size n, such that any two different vertices from the same class have…

Combinatorics · Mathematics 2021-12-01 Vladislav V. Kabanov

We investigate Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs, as well as some other domains such as multislices (Young…

Combinatorics · Mathematics 2020-10-08 Yuval Filmus , Ferdinand Ihringer

The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…

Combinatorics · Mathematics 2025-12-16 Jan Hladký , Petr Savický

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…

Combinatorics · Mathematics 2019-04-26 Cunsheng Ding , Akihiro Munemasa , Vladimir Tonchev

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

Combinatorics · Mathematics 2014-05-29 Jiří Fiala , Pavel Klavík , Jan Kratochvíl , Roman Nedela

Plateaued functions as an extension of bent functions play a significant role in cryptography, coding theory, sequences and combinatorics. In \cite{Mesnager9}, Mesnager \emph{et al.} introduced generalized plateaued functions in order to…

Information Theory · Computer Science 2022-03-31 Jiaxin Wang , Fang-Wei Fu

We consider random graphs in which the edges are allowed to be dependent. In our model the edge dependence is quite general, we call it $p$-robust random graph. It means that every edge is present with probability at least $p$, regardless…

Discrete Mathematics · Computer Science 2020-12-04 Zohre Ranjbar-Mojaveri , Andras Farago

Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bl\"aser ICALP 2013, Gentry CCC 2014] we attempt at obtaining a tight characterization of hard instances of…

Computational Complexity · Computer Science 2015-08-11 Christian Engels , B. V. Raghavendra Rao

The plethysms of the Weyl characters associated to a classical Lie group by the symmetric functions stabilize in large rank. In the case of a power sum plethysm, we prove that the coefficients of the decomposition of this stabilized form on…

Representation Theory · Mathematics 2008-03-21 Cedric Lecouvey

Let $G=(V,E)$ be a graph and $A$ its adjacency matrix. We say that a vertex $y \in V$ is a function of vertices $x_1, \ldots, x_k \in V$ if there exists a Boolean function $f$ of $k$ variables such that for any vertex $z \in V - \{y, x_1,…

Combinatorics · Mathematics 2018-07-06 Bogdan Alecu , Aistis Atminas , Vadim Lozin

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…

Functional Analysis · Mathematics 2010-04-30 Murad Banaji

Let $C(d,k)$ and $AC(d,k)$ be the largest order of a Cayley graph and a Cayley graph based on an abelian group, respectively, of degree $d$ and diameter $k$. When $k=2$, it is well-known that $C(d,2)\le d^2+1$ with equality if and only if…

Combinatorics · Mathematics 2015-06-19 Alexander Pott , Yue Zhou

Bent functions are Boolean functions in an even number of variables that are indicators of Hadamard difference sets in elementary abelian 2-groups. A bent function in m variables is said to be normal if it is constant on an affine space of…

Discrete Mathematics · Computer Science 2025-05-01 Valérie Gillot , Philippe Langevin , Alexandr Polujan

Let Phi be a reduced root system of rank r. A Weyl group multiple Dirichlet series for Phi is a Dirichlet series in r complex variables s_1,...,s_r, initially converging for Re(s_i) sufficiently large, which has meromorphic continuation to…

Number Theory · Mathematics 2007-05-23 Gautam Chinta , Solomon Friedberg , Paul E. Gunnells

In a recent paper, Caro, Lauri, Mifsud, Yuster, and Zarb ask which parameters $r$ and $c$ admit the existence of an $r$-regular graph such that the neighborhood of each vertex induces exactly $c$ edges. They show that every $r$ with $c$…

Combinatorics · Mathematics 2025-07-22 Nathan S. Sheffield , Zoe Xi
‹ Prev 1 4 5 6 7 8 10 Next ›