Quick search
Advanced search in
Field to searchTerm
Add rule
Filters
Filters
Filters
Download Results
22,101 research outcomes, page 1 of 443
  • publication . Master thesis . 2007
    Restricted Czech
    Authors:
    Rytíř, Pavel;

    This thesis studies triangular con gurations, binary matroids, and integer lattices generated by the codewords of a binary code. We study the following hypothesis: the lattice generated by the codewords of a binary code has a basis consisting only of the codewords. We p...

  • publication . Article . 2015
    Open Access English
    Authors:
    Feigin, B.; Hoshino, A.; Noumi, M.; Shibahara, J.; Shiraishi, J.;
    Publisher: Інститут математики НАН України

    We present explicit formulas for the Macdonald polynomials of types Cn and Dn in the one-row case. In view of the combinatorial structure, we call them ''tableau formulas''. For the construction of the tableau formulas, we apply some transformation formulas for the basi...

  • publication . Doctoral thesis . Master thesis . 2009
    Restricted English
    Authors:
    Cibulka, Josef;

    One of the problems in Euclidean Ramsey theory is to determine the chromatic number of the Euclidean space. The chromatic number of a space is the minimum number of colors with which the whole space can be colored so that no two points of the same color are at unit dist...

  • publication . Article . undefined
    Open Access English
    Publisher: Published by Elsevier Inc.
  • publication . Article . 2005
    Open Access Catalan; Valencian
    Authors:
    Develin, Mike;
    Publisher: Universitat de Barcelona

    The tropical semiring $(\mathbb {R},min,+)$ has enjoyed a recent renaissance, owing to its connections to mathematical biology as well as optimization and algebraic geometry. In this paper, we investigate the space of labeled $n$-point configurations lying on a tropical...

  • publication . Article . 2014
    Open Access
    Authors:
    Al'pin Y.;

    A counterpart of the well-known Harary theorem on signed graphs is proved for digraphs over groups. This result is then used to derive a known theorem on the diagonal similarity of matrices and Kolmogorov's criterion of the reversibility of Markov chains. © 2014 Springe...

  • publication . Other literature type . 2020
    English
    Authors:
    Chan, Brian Tianyao;
    Persistent Identifiers
    Publisher: University of British Columbia

    In this thesis, we make progress on the problem of enumerating tableaux on non-classical shapes by introducing a general family of P-partitions that we call periodic P-partitions. Such a family of P-partitions generalizes the parallelogramic shapes, which were analysed ...

    Add to ORCIDorcid
  • publication . Other literature type . 2019
    English
    Authors:
    Stump, Christian; Thomas, Hugh; Williams, Nathan;
    Persistent Identifiers
    Publisher: Mathematisches Forschungsinstitut Oberwolfach

    The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuß-Catalan generalizations. We provide new viewpoints for both and introduce...

    Add to ORCIDorcid
  • publication . Article . undefined
    Open Access English
    Authors:
    Malvenuto, Claudia; Pappalardi, Francesco;
    Publisher: Elsevier Inc.
  • publication . Article . 2021
    English
    Authors:
    Mezo, Istvan; Wang, Chen-Ying; Guan, Hai-Yan;
    Persistent Identifiers
    Publisher: Contributions to Discrete Mathematics

    In this work we study the zeros of the Eulerian and Bell polynomials and their generalizations. More concretely, lower estimates for the leftmost zeros of these polynomials will be given, complementing earlier results where upper estimations were presented.

    Add to ORCIDorcid
  • publication . Article . 2004
    Open Access English
    Authors:
    Bondarenko, V.M.; Polishchuk, A.M.;
    Publisher: Інститут прикладної математики і механіки НАН України

    In this paper we study the structure of infinite posets with positive Tits form. In particular, there arise posets of specific form which we call minimax sums of posets.

  • publication . Preprint . 2020
    Open Access
    Authors:
    Wen-Hui Li; Feng Qi; Omran Kouba; Issam Kaddoura;
    Persistent Identifiers
    Publisher: Center for Open Science

    In the paper, motivated by the generating function of the Catalan numbers in combinatorial number theory and with the aid of Cauchy's integral formula in complex analysis, the authors generalize the Catalan numbers and its generating function, establish an explicit form...

    Add to ORCIDorcid
  • publication . Other literature type . 2020
    Authors:
    Biers-Ariel, Yonah;
    Persistent Identifiers
    Publisher: No Publisher Supplied

    This thesis demonstrates several applications of experimental methods to the enumeration of pattern-avoiding permutations. First, we introduce flexible schemes -- a new extension of enumeration schemes. We show how a computer can find flexible schemes and use them to co...

    Add to ORCIDorcid
  • publication . Doctoral thesis . 2017
    English
    Authors:
    Gilmore, Tomack;
    Persistent Identifiers
    Publisher: (:none)

    Diese Arbeit befasst sich mit der genauen und asymptotischen Aufz��hlung von Rhombusflasterungen von Sechsecken, die L��cher in ihrem Inneren enthalten, und dem vermuteten Zusammenhang zwischen diesen kombinatorischen Objekten und der zweidimensionalen Elektrostatik.

    Add to ORCIDorcid
  • other research product . 2018
    Open Access English
    Authors:
    Conlon, David; Lee, Joonkyung;

    A celebrated conjecture of Sidorenko and Erdős-Simonovits states that, for all bipartite graphs H, quasirandom graphs contain asymptotically the minimum number of copies of H taken over all graphs with the same order and edge density. This conjecture has attracted consi...

  • publication . Conference object . 2009
    Open Access English
    Authors:
    King, Ronald C.;

    The evaluation of characters of symmetric groups as polynomials in class numbers will be discussed, along with their use in evaluating Kronecker coefficients of both conventional and reduced type. Some properties of the polynomial and quasi-polynomial behaviour of stret...

  • publication . Article . 2017
    Open Access Indonesian
    Authors:
    Rhomdani, Rohmad Wahid;
    Publisher: Universitas Muhammadiyah Jember

    Abstract A graph of order and size is called an(,)-edge-antimagic if there exist a bijection ∶ () ∪ () → {1,2,…, + }such that the edge-weights() = () + () + (), ∈ (), form an arithmetic sequence with first term term and common difference. Such a graphis called super if ...

  • publication . Article . undefined
    Open Access English
    Authors:
    Mansour, Toufik; Yan, Sherry H.F.;
    Publisher: Elsevier Ltd.

    AbstractRecently, Bouvel and Pergola initiated the study of a special class of permutations, minimal permutations with a given number of descents, which arise from the whole genome duplication–random loss model of genome rearrangement. In this paper, we show that the nu...

  • publication . Article . undefined
    Open Access English
    Authors:
    Bender, Edward A; Canfield, E.Rodney; Richmond, L.Bruce;
    Publisher: Published by Elsevier Inc.

    AbstractWe extend some of the earlier results on the enumeration of rooted maps on a surface by number of edges to simultaneous enumeration by vertices and faces. In particular, (i) an asymptotic formula is obtained, (ii) the generating functions on orientable surfaces ...

  • publication . Article . 2008 . Embargo End Date: 06 Feb 2008
    English
    Authors:
    Cossidente, Antonio; De Resmini, Marialuisa J.;
    Publisher: Faculty of Science, University of Calgary

    Contributions to Discrete Mathematics, Vol 3, No 1 (2008)

    Add to ORCIDorcid
  • publication . Other literature type . 2010
    Authors:
    Nguyen, Hoi H.;
    Persistent Identifiers
    Publisher: No Publisher Supplied

    The celebrated Freiman's inverse theorem in Additive Combinatorics asserts that an additive set of small doubling constant must have additive structure. This thesis contains two applications achieved by combining this theorem with a dyadic pigeonhole principle technique...

    Add to ORCIDorcid
  • publication . Article . 2010 . Embargo End Date: 06 Apr 2010
    English
    Authors:
    Maffioli, Francesco; Zagaglia Salvi, Norma;
    Publisher: Faculty of Science, University of Calgary

    Let $M = (E, \mathcal{F})$ be a matroid on a set $E$ and $B$ one of its bases. A closed set $\theta \subseteq E$ is saturated with respect to $B$ when $|\theta \cap B | \leq r(\theta)$, where $r(\theta)$ is the rank of $\theta$. The collection of subsets $I$ of $E$ such...

    Add to ORCIDorcid
  • publication . Doctoral thesis . 2012
    Open Access English
    Authors:
    Jurrius, R.P.M.J.;

    Codes, arrangements, matroids, and their polynomial links Many mathematical objects are closely related to each other. While studying certain aspects of a mathematical object, one tries to find a way to "view" the object in a way that is most suitable for a specific pro...

  • other research product . 2012
    Open Access English
    Authors:
    Conlon, David; Fox, Jacob; Sudakov, Benny;

    A famous conjecture of Sidorenko and Erdős-Simonovits states that if H is a bipartite graph then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and edge density. The goal of this...

  • publication . Book . 2015
    Open Access English
    Authors:
    Bodlaender, Hans; Boros, Endre; Heggernes, Pinar; Kratsch, Dieter;
    Persistent Identifiers

    This is a collection of open problems presented at the Lorentz Workshop “Enumeration Algorithms using Structure” which took place at the Lorentz Center of the University of Leiden (The Netherlands), August 24 - 30, 2015. The workshop brought together researchers interes...

    Add to ORCIDorcid
  • publication . Doctoral thesis . 2017
    English
    Authors:
    Sulzgruber, Robin;
    Persistent Identifiers
    Publisher: (:none)

    Cayley-Catalan combinatorics refers to the study of combinatorial objects counted by (generalised) Catalan numbers or Cayley numbers. Examples of classical combinatorial objects treated in this thesis that fall into this category are Dyck paths, parking functions and co...

    Add to ORCIDorcid
  • publication . Conference object . 2008
    Closed Access English
    Authors:
    McAllister, T.B.; Dehmer, M.; Drmota, M.; Emmert-Streib, F.;
    Publisher: CSREA Press

    In 1976, P. R. Scott characterized the Ehrhart polynomials of convex integral polygons. We study the same question for Ehrhart polynomials and quasi-polynomials of \emph{non}-integral convex polygons. Define a \emph{pseudo-integral polygon}, or \emph{PIP}, to be a conve...

  • publication . Article . 2020
    Open Access
    Authors:
    Myat Thit Soe;
    Publisher: Zenodo

    In this paper, the notion of derivation on partially ordered sets or posets is introduced and studied. Several examples of posets are presented. The properties of the fixed points based on the derivations are investigated. Finally, the isomorphism of posets and dual pos...

    Add to ORCIDorcid
  • publication . Article . 2021
    Authors:
    A.I. Mikov; A.A. Mikov;
    Persistent Identifiers
    Publisher: Informatization and Communication Journal Editorial Board

    Random geometric hypergraphs are considered as mathematical models of large wireless computer networks. The dependences of the mathematical expectation of the number of hyper-edges in random geometric hypergraphs on the radii of reliable reception / transmission of radi...

    Add to ORCIDorcid
  • publication . Article . undefined
    Open Access English
    Publisher: Published by Elsevier B.V.
  • publication . Article . 2014
    Open Access English
    Authors:
    Gasiorek, M.; Simson, D.; Zajac, K.;
    Publisher: Інститут прикладної математики і механіки НАН України

    We present symbolic and numerical algorithms for a computer search in the Coxeter spectral classification problems. One of the main aims of the paper is to study finite posets I that are principal, i.e., the rational symmetric Gram matrix GI : = 1/2[CI+CItr] ∈ MI(Q) of ...

  • publication . Other literature type . 2011 . Embargo End Date: 20 Oct 2011
    English
    Authors:
    Faculty Of Science, University Of Calgary;
    Persistent Identifiers
    Publisher: Faculty of Science, University of Calgary

    A variant of the bipartite relation theorem and its application to clique graphs Signed star k-domatic number of a graph A bijection between noncrossing and nonnesting partitions of types A, B and C A graph theoretic proof of the complexity of colouring by a local tourn...

    Add to ORCIDorcid
  • publication . Thesis . 2016
    Open Access
    Authors:
    Chan, Justin Ho-Chung;

    We study three problems involving permutations: the n-card problem, inv-Wilf-equivalence, and suitable sets of permutations. The n-card problem is to determine the minimal intervals [u, v] such that for every n times n stochastic matrix A there is an n times n permutati...

  • publication . Doctoral thesis . 2015
    Authors:
    Bobrowski, Jacob;
    Persistent Identifiers
    Publisher: University of Nevada, Las Vegas

    I investigate the divisibility properties of generalized Catalan numbers by ex- tending known results for ordinary Catalan numbers to their general case. First, I define the general Catalan numbers and provide a new derivation of a known formula. Second, I show several ...

    Add to ORCIDorcid
  • publication . Article . 2011
    Open Access English
    Authors:
    Chia, G. L.; Carsten Thomassen;

    Robertson ([5]) and independently, Bondy ([1]) proved that the generalized Petersen graph P(n, 2) is non-hamiltonian if n equivalent to 5 ( mod 6), while Thomason [7] proved that it has precisely 3 hamiltonian cycles if n equivalent to 3 (mod 6). The hamiltonian cycles ...

  • publication . Doctoral thesis . 2013
    Open Access English
    Authors:
    Yu, Haitao;
    Publisher: tuprints

    Sprays and droplets are involved in numerous industrial processes and in nature, e.g. fuel injection in combustion chambers, painting, spray cooling, spray coating, chemical engineering, cloud physics, etc. The understanding of the light scattering features from the dro...

  • research data . 2015
    English
    Authors:
    Prasanna Kumar, N.;
    Persistent Identifiers
    Publisher: University of Salento

    In this paper, we shall derive a generalized form of Turan's inequality for a special class of polynomials with restricted zeros.

    Add to ORCIDorcid
  • publication . Article . 2020
    English
    Authors:
    MacKeigan, Kyle; Janssen, Jeannette;
    Persistent Identifiers
    Publisher: Contributions to Discrete Mathematics

    A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the same colour. The total chromatic number of some direct product graphs are determined. In...

    Add to ORCIDorcid
  • publication . Article . undefined
    Open Access English
    Publisher: Published by Elsevier Ltd.
  • publication . Article . 2020
    Authors:
    Briant Sabathino Harya Wibawa; A Suparmi; C Cari;
    Persistent Identifiers
    Publisher: Universitas Sebelas Maret

    <p class="Abstract">The application bispherical coordinates in Schrödinger equation for the Mobius square plus modified Yukawa potential have been obtained. The Schrödinger equation in bispherical coordinates for the separable Mobius square plus modified Yukawa po...

    Add to ORCIDorcid
  • publication . Article . 2021
    Open Access
    Authors:
    Francisco J. Muñoz; Juan Carlos Nuño;
    Persistent Identifiers
    Publisher: MDPI AG

    Periodic series of period T can be mapped into the set of permutations of [T−1]={1,2,3,…,T−1}. These permutations of period T can be classified according to the relative ordering of their elements by the horizontal visibility map. We prove that the number of horizontal ...

    Add to ORCIDorcid
  • publication . Article . 2010
    Open Access Russian
    Publisher: Федеральное государственное бюджетное образовательное учреждение высшего профессионального образования «Национальный исследовательский Томский государственный университет»

    Some upper bounds are given for the complexity of enumerating elements in non-uniformly distributed key spaces.

  • publication . Article . undefined
    Open Access English
    Publisher: Published by Elsevier B.V.
  • publication . Doctoral thesis . 2000
    Authors:
    Starr, Angela Marie;
    Persistent Identifiers
    Publisher: University of Nevada, Las Vegas

    This paper will present the historical development of theorems regarding permutation polynomials in several variables over finite fields. Single variable permutation polynomials will be discussed since they are so important to the discussions which will follow. Theorems...

    Add to ORCIDorcid
  • publication . Thesis . 2014
    Open Access
    Authors:
    Jones, Bradley Robert;

    This thesis relates similar ideas from enumerative combinatorics, Hopf algebraic quantum field theory and differential analysis. Hook length formulae, from enumerative combinatorics, are equations that can lead to bijections between tree classes and other combinatorial ...

  • publication . Article . 2019
    English
    Authors:
    Reyna, Gerardo; Romero, Jesús; Espinobarros, Ivan;
    Persistent Identifiers
    Publisher: Contributions to Discrete Mathematics

    Contributions to Discrete Mathematics, Vol 14 No 1 (2019)

    Add to ORCIDorcid
  • other research product . 2019
    Open Access English
    Authors:
    Petrov, Fedor; Pohoata, Cosmin;

    A celebrated theorem due to Bannai-Bannai-Stanton says that if A is a set of points in ℝ^d, which determines s distinct distances, then |A| ≤ (d+s/s). In this note, we give a new simple proof of this result by combining Sylvester's Law of Inertia for quadratic forms wit...

  • software . 2016
    Open Source
    Authors:
    Eric Archer;
    Persistent Identifiers
    Publisher: Zenodo

    Estimate Permutation p-Values for Random Forest Importance Metrics

    Add to ORCIDorcid
  • publication . Other literature type . 2007
    Authors:
    Vijay, Sujith;
    Persistent Identifiers
    Publisher: No Publisher Supplied

    A beautiful result in the study of arithmetic progressions modulo 1 is the three distance theorem, conjectured by Steinhaus and proved by Sós, Świerczkowski et al. According to this theorem, there are at most three distinct gaps between consecutive elements in any finit...

    Add to ORCIDorcid
22,101 research outcomes, page 1 of 443